Fernández-Baca, David; Liu, Lei Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study. (English) Zbl 1461.68150 Algorithms (Basel) 12, No. 3, Paper No. 53, 24 p. (2019). MSC: 68R10 05C40 68W40 92-08 92D15 PDFBibTeX XMLCite \textit{D. Fernández-Baca} and \textit{L. Liu}, Algorithms (Basel) 12, No. 3, Paper No. 53, 24 p. (2019; Zbl 1461.68150) Full Text: DOI
Deng, Yun; Fernández-Baca, David Fast compatibility testing for phylogenies with nested taxa. (English) Zbl 1383.92053 Frith, Martin (ed.) et al., Algorithms in bioinformatics. 16th international workshop, WABI 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-43680-7/pbk; 978-3-319-43681-4/ebook). Lecture Notes in Computer Science 9838. Lecture Notes in Bioinformatics, 90-101 (2016). MSC: 92D15 92B10 PDFBibTeX XMLCite \textit{Y. Deng} and \textit{D. Fernández-Baca}, Lect. Notes Comput. Sci. 9838, 90--101 (2016; Zbl 1383.92053) Full Text: DOI arXiv
Vakati, Sudheer; Fernández-Baca, David Graph triangulations and the compatibility of unrooted phylogenetic trees. (English) Zbl 1209.05055 Appl. Math. Lett. 24, No. 5, 719-723 (2011). MSC: 05C05 05C70 05C85 92D15 PDFBibTeX XMLCite \textit{S. Vakati} and \textit{D. Fernández-Baca}, Appl. Math. Lett. 24, No. 5, 719--723 (2011; Zbl 1209.05055) Full Text: DOI
Chen, Duhong; Diao, L.; Eulenstein, O.; Fernández-Baca, D.; Sanderson, M. Flipping: A supertree construction method. (English) Zbl 1036.92020 Janowitz, M. F. (ed.) et al., Bioconsensus. DIMACS working group meetings on bioconsensus, October 25–26, 2000 and October 2–5, 2001, DIMACS Center. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3197-6/hbk). DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 61, 135-160 (2003). MSC: 92D15 92B10 05C05 05C90 65Y20 PDFBibTeX XMLCite \textit{D. Chen} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 61, 135--160 (2003; Zbl 1036.92020)
Agarwala, Richa; Fernández-Baca, David A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. (English) Zbl 0835.68052 SIAM J. Comput. 23, No. 6, 1216-1224 (1994). MSC: 68Q25 92-08 PDFBibTeX XMLCite \textit{R. Agarwala} and \textit{D. Fernández-Baca}, SIAM J. Comput. 23, No. 6, 1216--1224 (1994; Zbl 0835.68052) Full Text: DOI