Wird geladen...
Recursions for statistical multiple alignment
Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne–Kishino–Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences and their alignment...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
National Academy of Sciences
2003
|
| Schlagworte: | |
| Online Zugang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC299860/ https://ncbi.nlm.nih.gov/pubmed/14657378 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.2036252100 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|