We consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 -2/k, and Pevzner (1992) who
β¦ LIBER β¦
Bayesian adaptive sequence alignment algorithms
β Scribed by Zhu, J.; Liu, J. S.; Lawrence, C. E.
- Book ID
- 121823302
- Publisher
- Oxford University Press
- Year
- 1998
- Tongue
- English
- Weight
- 859 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1367-4803
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Approximation algorithms for multiple se
β
Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner
π
Article
π
1997
π
Elsevier Science
π
English
β 793 KB
Parametric and ensemble sequence alignme
β
Michael S. Waterman
π
Article
π
1994
π
Springer
π
English
β 1020 KB
## Proceedings of the Third Annual ACM-SIAM Discrete Algorithms) find optimal scores for all penalty parameters, both for global and local sequence alignment. This paper reviews those techniques Then in the main part of this paper dynamic programming methods are used to compute ensemble alignment,
Algorithms for path-constrained sequence
β
Pinhas, Tamar; Milo, Nimrod; Kucherov, Gregory; Ziv-Ukelson, Michal
π
Article
π
2014
π
Elsevier Science
π
English
β 326 KB
Bayesian coestimation of phylogeny and s
β
Gerton Lunter; IstvΓ‘n MiklΓ³s; Alexei Drummond; Ledet Jens Jensen; Jotun Hein
π
Article
π
2005
π
BioMed Central
π
English
β 354 KB
Algorithmic properties of ciliate sequen
β
J. Mark Keil; Jing Liu; Ian McQuillan
π
Article
π
2010
π
Elsevier Science
π
English
β 635 KB
Improving multiple sequence alignment bi
β
Miquel Orobitg, Fernando Cores, Fernando Guiradoβ¦
π
Article
π
2013
π
Springer US
π
English
β 522 KB