TY - JOUR AU - Dress, A. AU - Steel, M. PY - 1992 DA - 1992// TI - Convex tree realizations of partitions JO - Appl Math Lett VL - 5 UR - https://doi.org/10.1016/0893-9659(92)90026-6 DO - 10.1016/0893-9659(92)90026-6 ID - Dress1992 ER - TY - JOUR AU - Kannan, S. AU - Warnow, T. PY - 1994 DA - 1994// TI - Inferring evolutionary history from DNA sequences JO - SIAM J Comput VL - 23 UR - https://doi.org/10.1137/S0097539791222171 DO - 10.1137/S0097539791222171 ID - Kannan1994 ER - TY - JOUR AU - Lam, F. AU - Gusfield, D. AU - Sridhar, S. PY - 2011 DA - 2011// TI - Generalizing the four gamete condition and splits equivalence theorem: perfect phylogeny on three state characters JO - SIAM J Discrete Math VL - 25 UR - https://doi.org/10.1137/090776305 DO - 10.1137/090776305 ID - Lam2011 ER - TY - JOUR AU - Bodlaender, H. AU - Fellows, M. AU - Warnow, T. PY - 1992 DA - 1992// TI - Two strikes against perfect phylogeny JO - Automata, Languages and Programming, 19th International Colloquium, ICALP 1992, Vienna, Austria, July 13-17, 1992, Proceedings. LNCS VL - 623 ID - Bodlaender1992 ER - TY - JOUR AU - Steel, M. A. PY - 1992 DA - 1992// TI - The complexity of reconstructing trees from qualitative characters and subtrees JO - J Classification VL - 9 UR - https://doi.org/10.1007/BF02618470 DO - 10.1007/BF02618470 ID - Steel1992 ER - TY - JOUR AU - Gusfield, D. PY - 1991 DA - 1991// TI - Efficient algorithms for inferring evolutionary trees JO - Networks VL - 21 UR - https://doi.org/10.1002/net.3230210104 DO - 10.1002/net.3230210104 ID - Gusfield1991 ER - TY - BOOK AU - Semple, C. AU - Steel, M. PY - 2003 DA - 2003// TI - Phylogenetics. Oxford Lecture Series in Mathematics and Its Applications PB - Oxford University Press CY - New York ID - Semple2003 ER - TY - JOUR AU - Agarwala, R. AU - Fernandez-Baca, D. PY - 1994 DA - 1994// TI - A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed JO - SIAM J Comput VL - 23 UR - https://doi.org/10.1137/S0097539793244587 DO - 10.1137/S0097539793244587 ID - Agarwala1994 ER - TY - JOUR AU - Kannan, S. AU - Warnow, T. PY - 1997 DA - 1997// TI - A fast algorithm for the computation and enumeration of perfect phylogenies JO - SIAM J Comput VL - 26 UR - https://doi.org/10.1137/S0097539794279067 DO - 10.1137/S0097539794279067 ID - Kannan1997 ER - TY - JOUR AU - Buneman, P. PY - 1974 DA - 1974// TI - A characterisation of rigid circuit graphs JO - Discrete Math VL - 9 UR - https://doi.org/10.1016/0012-365X(74)90002-8 DO - 10.1016/0012-365X(74)90002-8 ID - Buneman1974 ER - TY - JOUR AU - Blair, J. AU - Peyton, B. PY - 1994 DA - 1994// TI - An introduction to chordal graphs and clique trees JO - IMA Volumes in Mathematics and its Applications VL - 56 UR - https://doi.org/10.1007/978-1-4613-8369-7_1 DO - 10.1007/978-1-4613-8369-7_1 ID - Blair1994 ER - TY - JOUR AU - Dirac, G. A. PY - 1961 DA - 1961// TI - On rigid circuit graphs JO - Abh Math Sem Univ Hamburg VL - 25 UR - https://doi.org/10.1007/BF02992776 DO - 10.1007/BF02992776 ID - Dirac1961 ER - TY - JOUR AU - Gavril, F. PY - 1974 DA - 1974// TI - The intersection graphs of subtrees in trees are exactly the chordal graphs JO - J Comb Theory, Ser B VL - 16 UR - https://doi.org/10.1016/0095-8956(74)90094-X DO - 10.1016/0095-8956(74)90094-X ID - Gavril1974 ER - TY - JOUR AU - Gusfield, D. PY - 2010 DA - 2010// TI - The multi-state perfect phylogeny problem with missing and removable data JO - J Comput Biol VL - 17 UR - https://doi.org/10.1089/cmb.2009.0200 DO - 10.1089/cmb.2009.0200 ID - Gusfield2010 ER - TY - BOOK AU - Golumbic, M. PY - 2004 DA - 2004// TI - Algorithmic graph theory and perfect graphs. Volume 57 of Annals of Discrete Mathematics PB - Elsevier Science Publishers CY - Essex, UK ID - Golumbic2004 ER - TY - JOUR AU - Kloks, T. AU - Kratsch, D. AU - Spinrad, J. PY - 1997 DA - 1997// TI - On treewidth and minimum fill-in of asteroidal triple-free graphs JO - Theor Comput Sci VL - 175 UR - https://doi.org/10.1016/S0304-3975(96)00206-X DO - 10.1016/S0304-3975(96)00206-X ID - Kloks1997 ER - TY - JOUR AU - Parra, A. AU - Scheffler, P. PY - 1995 DA - 1995// TI - How to use the minimal separators of a graph for its chordal triangulation JO - Automata, Languages and Programming, 22nd International Colloquium, ICALP 1995, Szeged, Hungary, July 10-14, 1995, Proceedings. LNCS VL - 944 ID - Parra1995 ER - TY - JOUR AU - Parra, A. AU - Scheffler, P. PY - 1997 DA - 1997// TI - Characterizations and algorithmic applications of chordal graph embeddings JO - Discret Appl Math VL - 79 UR - https://doi.org/10.1016/S0166-218X(97)00041-3 DO - 10.1016/S0166-218X(97)00041-3 ID - Parra1997 ER - TY - JOUR AU - Berry, A. AU - Bordat, J. P. AU - Heggernes, P. AU - Simonet, G. AU - Villanger, Y. PY - 2006 DA - 2006// TI - A wide-range algorithm for minimal triangulation from an arbitrary ordering JO - J Algorithms VL - 58 UR - https://doi.org/10.1016/j.jalgor.2004.07.001 DO - 10.1016/j.jalgor.2004.07.001 ID - Berry2006 ER - TY - JOUR AU - Gysel, R. AU - Lam, F. AU - Gusfield, D. PY - 2011 DA - 2011// TI - Constructing perfect phylogenies and proper triangulations for three-state characters JO - Algorithms in Bioinformatics, 11th International Workshop, WABI 2011, Saarbrücken, Germany, September 5-7, 2011, Proceedings. LNCS VL - 6833 ID - Gysel2011 ER - TY - JOUR AU - Ho, C. AU - Lee, R. PY - 1989 DA - 1989// TI - Counting clique trees and computing perfect elimination schemes in parallel JO - Inf Process Lett VL - 31 UR - https://doi.org/10.1016/0020-0190(89)90070-7 DO - 10.1016/0020-0190(89)90070-7 ID - Ho1989 ER - TY - JOUR AU - Blair, J. AU - Peyton, B. PY - 1994 DA - 1994// TI - On finding minimum-diameter clique trees JO - Nordic J Comput VL - 1 ID - Blair1994 ER - TY - JOUR AU - Tarjan, R. AU - Yannakakis, M. PY - 1984 DA - 1984// TI - Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs JO - SIAM J Comput VL - 13 UR - https://doi.org/10.1137/0213035 DO - 10.1137/0213035 ID - Tarjan1984 ER -