An algorithm for statistical alignment of sequences related by a binary tree.

Journal article

Abstract:: An algorithm is presented that allows the calculation of the probability of a set of sequences related by a binary tree that has evolved according to the Thorne-Kishino-Felsenstein model (1991) for a fixed set of parameters. There are two ideas underlying this algorithm. Firstly, a markov chain is defined that generates ancestral sequences and their alignment at two neighboring nodes in a tree. Secondly, a stochastic walk on the binary tree, that defines a markov chain generating ancestral se...
Expand abstract
Collapse abstract

Role:

Author

Journal:: Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
Pages:: 179-190
Publication date:: 2001-01-01
ISSN:: 2335-6936
Source identifiers:: 102837

Language:: English
Keywords:: Models, Statistical

Markov Chains

Sequence Alignment

Algorithms

Evolution, Molecular

Stochastic Processes
Pubs id:: pubs:102837
UUID:: uuid:427179d1-9279-4017-a32e-0cd78bac3826
Local pid:: pubs:102837
Deposit date:: 2013-02-20

Licence:: Terms and Conditions of Use for Oxford University Research Archive

If you are the owner of this record, you can report an update to it here: Report update to this record