טוען...
An Eulerian path approach to local multiple alignment for DNA sequences
Expensive computation in handling a large number of sequences limits the application of local multiple sequence alignment. We present an Eulerian path approach to local multiple alignment for DNA sequences. The computational time and memory usage of this approach is approximately linear to the total...
שמור ב:
| Main Authors: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
National Academy of Sciences
2005
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC547885/ https://ncbi.nlm.nih.gov/pubmed/15668398 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0409240102 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|