Who is Who in Phylogenetic Networks

Publication no #658   Type :   Html | Bib | Both

Created: 2008-09-25 16:18:40     Modified: 2008-11-27 23:35:39

658 Ernst Althaus and Rouven Naujoks. Reconstructing Phylogenetic Networks with One Recombination. In Proceedings of the seventh International Workshop on Experimental Algorithms (WEA'08), Vol. 5038:275-288 of LNCS, springer, 2008. Keywords: enumeration, explicit network, exponential algorithm, from sequences, generation, parsimony, phylogenetic network, phylogeny, reconstruction, unicyclic network. Note: http://dx.doi.org/10.1007/978-3-540-68552-4_21.         Toggle abstract "In this paper we propose a new method for reconstructing phylogenetic networks under the assumption that recombination events have occurred rarely. For a fixed number of recombinations, we give a generalization of the maximum parsimony criterion. Furthermore, we describe an exact algorithm for one recombination event and show that in this case our method is not only able to identify the recombined sequence but also to reliably reconstruct the complete evolutionary history. © 2008 Springer-Verlag Berlin Heidelberg." @InProceedings{AlthausNaujoks2008,       AUTHOR = {Althaus, Ernst and Naujoks, Rouven},       TITLE = {Reconstructing Phylogenetic Networks with One Recombination},       YEAR = {2008},       BOOKTITLE = {Proceedings of the seventh International Workshop on Experimental Algorithms (WEA'08)},       VOLUME = {5038},       PAGES = {275-288},       SERIES = {LNCS},       PUBLISHER = {springer},       URL = {http://dx.doi.org/10.1007/978-3-540-68552-4_21},       NOTE = {http://dx.doi.org/10.1007/978-3-540-68552-4_21},       ANNOTE = {CITE : },       KEYWORDS = {enumeration, explicit network, exponential algorithm, from sequences, generation, parsimony, phylogenetic network, phylogeny, reconstruction, unicyclic network} }