### Abstract

The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorithm computes the probability of a set of such sequences in O(l^{2k}) time, where l is the geometric mean of the sequence lengths and k is the number of sequences. An improved algorithm is presented whose running time is only O(2^{2k}l^{k}).

Original language | English |
---|---|

Pages (from-to) | 771-779 |

Number of pages | 9 |

Journal | Bulletin of Mathematical Biology |

Volume | 64 |

Issue number | 4 |

DOIs | |

Publication status | Published - Jul 2002 |

### Fingerprint

### ASJC Scopus subject areas

- Agricultural and Biological Sciences(all)

### Cite this

**An improved algorithm for statistical alignment of sequences related by a star tree.** / Miklós, I.

Research output: Contribution to journal › Article

*Bulletin of Mathematical Biology*, vol. 64, no. 4, pp. 771-779. https://doi.org/10.1006/bulm.2002.0300

}

TY - JOUR

T1 - An improved algorithm for statistical alignment of sequences related by a star tree

AU - Miklós, I.

PY - 2002/7

Y1 - 2002/7

N2 - The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorithm computes the probability of a set of such sequences in O(l2k) time, where l is the geometric mean of the sequence lengths and k is the number of sequences. An improved algorithm is presented whose running time is only O(22klk).

AB - The insertion-deletion model developed by Thorne, Kishino and Felsenstein (1991, J. Mol. Evol., 33, 114-124; the TKF91 model) provides a statistical framework of two sequences. The statistical alignment of a set of sequences related by a star tree is a generalization of this model. The known algorithm computes the probability of a set of such sequences in O(l2k) time, where l is the geometric mean of the sequence lengths and k is the number of sequences. An improved algorithm is presented whose running time is only O(22klk).

UR - http://www.scopus.com/inward/record.url?scp=0036664813&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036664813&partnerID=8YFLogxK

U2 - 10.1006/bulm.2002.0300

DO - 10.1006/bulm.2002.0300

M3 - Article

C2 - 12216420

AN - SCOPUS:0036664813

VL - 64

SP - 771

EP - 779

JO - Bulletin of Mathematical Biology

JF - Bulletin of Mathematical Biology

SN - 0092-8240

IS - 4

ER -