Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 275-288

  To, Thu Hien ^a   Habib, Michel ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE ALGORITHMS; PHYLOGENETIC NETWORKS; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME; SIMPLE NETWORKS; SPECIAL PROPERTIES; TIME ALGORITHMS;

PATTERN MATCHING; PHASE MODULATION; POLYNOMIAL APPROXIMATION;

SET THEORY;

EID: 70350676519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_25     Document Type: Conference Paper

References (12)

1. Alio, A. V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM Journal on Computing 10(3), 405-421 (1981)
2. Byrka, J., Gawrychowski, P., Huber, K.T., Kelk, S.: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (2008) arXiv:0710.3258v3 [q-bio.PE]
3. Choy, C., Jansson, J., Sadakane, K., Sung, W.-K.: Computing the Maximum Agreement of Phylogenetic Networks. Theoretical Computer Science 355(1), 93-107 (2005)
4. Gasieniec, L., Jansson, J., Lingas, A., Ostlin, A.: Inferring ordered trees from local constraints. In: CATS 1998, vol. 20(3), pp. 67-79 (1998)
5. Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomor-phic subtrees, with applications to computational evolutionary biology. Algorith-mica 24(1), 1-13 (1999)
6. Jansson, J., Nguyen, N.B., Sung, W.-K.: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. SIAM Journal on Computing 35(5), 1098-1121 (2006)
7. Jansson, J., Sung, W.-K.: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 462-471. Springer, Heidelberg (2004)
8. Jansson, J., Sung, W.-K.: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. Theoretical Computer Science 361(1), 60-68 (2006)
9. Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)
10. van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Hagen, F., Boekhout, T.: Constructing level-2 phylogenetic networks from triplets. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol. 4955, pp. 450-462. Springer, Heidelberg (2008)
11. van Iersel, L., Kelk, S.: Constructing the Simplest Possible Phylogenetic Network from Triplets. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 472-483. Springer, Heidelberg (2008)
12. van Iersel, L., Kelk, S., Mnich, M.: Uniqueness, Intractability and Exact Algorithms: Reflections on level-k Phylogenetic Networks. JBCB (2009)