Simple Reconstruction of Binary Near-Perfect

[1]  Elizabeth M. Smigielski,et al.  dbSNP: the NCBI database of genetic variation , 2001, Nucleic Acids Res..

[2]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[3]  Dan Gusfield,et al.  Efficient algorithms for inferring evolutionary trees , 1991, Networks.

[4]  Dan Gusfield,et al.  Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination , 2004, J. Bioinform. Comput. Biol..

[5]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[6]  Dan Gusfield,et al.  Efficient reconstruction of phylogenetic networks with constrained recombination , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[7]  Sampath Kannan,et al.  A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed , 1995, SODA '95.

[8]  Dan Gusfield,et al.  A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters , 2005, RECOMB.

[9]  David Fernández-Baca,et al.  A Polynomial-Time Algorithm for Near-Perfect Phylogeny , 1996, SIAM J. Comput..

[10]  R. Karp,et al.  Efficient reconstruction of haplotype structure via perfect phylogeny. , 2002, Journal of bioinformatics and computational biology.

[11]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[12]  H. Prömel,et al.  The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity , 2002 .

[13]  Peter Damaschke.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2006, Theor. Comput. Sci..