טוען...
An algorithm for progressive multiple alignment of sequences with insertions
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback...
שמור ב:
| Main Authors: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
National Academy of Sciences
2005
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC1180752/ https://ncbi.nlm.nih.gov/pubmed/16000407 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0409137102 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|