{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:49Z","timestamp":1710269329461},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2005,6,7]],"date-time":"2005-06-07T00:00:00Z","timestamp":1118102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00500-005-0507-7","type":"journal-article","created":{"date-parts":[[2005,6,7]],"date-time":"2005-06-07T06:52:37Z","timestamp":1118127157000},"page":"461-468","source":"Crossref","is-referenced-by-count":7,"title":["Maximal sub-triangulation in pre-processing phylogenetic data"],"prefix":"10.1007","volume":"10","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Sigayret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Sinoquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"507_CR1","doi-asserted-by":"crossref","unstructured":"Balas E (1986) A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Discrete Appl Math 15:123\u2013134","DOI":"10.1016\/0166-218X(86)90036-3"},{"key":"507_CR2","unstructured":"Barth\u00e9l\u00e9my J-P, Gu\u00e9noche A (1991) Trees and proximity representations. Wiley (eds), New York"},{"key":"507_CR3","unstructured":"Berry A (1999) A wide-range efficient algorithm for minimal triangulation. In: Proceedings of tenth annual ACM-SIAM symposium on discrete algorithms (SODA'99), 860\u2013861"},{"key":"507_CR4","doi-asserted-by":"crossref","unstructured":"Berry A, Blair J, Heggernes P (2002) Maximum cardinality search for computing minimal triangulations. In: Kucera L (ed) Graph theoretical concepts in computer science \u2013 WG 2002, LNCS 2573, Springer Berlin Heidelberg New York 1\u201312","DOI":"10.1007\/3-540-36379-3_1"},{"key":"507_CR5","doi-asserted-by":"crossref","unstructured":"Berry A, Bordat J-P, Heggernes P (2000) Recognizing weakly triangulated graphs by edge separability. Nordic J Comput 7:164\u2013177","DOI":"10.1007\/3-540-44985-X_13"},{"key":"507_CR6","unstructured":"Berry A, Heggernes P, Villanger Y (2003) An on-line incremental approach for dynamically maintaining chordal graphs. Research Report LIMOS: RR 2003-04"},{"key":"507_CR7","unstructured":"Berry A, Bordat J-P, Heggernes P, Simonet G, Villanger Y (2003) A wide-range algorithm for minimal triangulation from an arbitrary ordering. Technical report reports in informatics 243, University of Bergen (Norway); Research Report LIMOS: RR 2003-02. J Algorithms (submitted)"},{"key":"507_CR8","unstructured":"Berry A, Sigayret A, Sinoquet C (2002) Towards improving phylogeny reconstruction with combinatorial-based constraints on an underlying family of graphs. Research Report LIMOS: RR 02-103"},{"key":"507_CR9","doi-asserted-by":"crossref","unstructured":"Berry V, Gascuel O (2000) Inferring evolutionary trees with strong combinatorial evidence. Theor Comput Sci 240 2:271\u2013298","DOI":"10.1016\/S0304-3975(99)00235-2"},{"key":"507_CR10","doi-asserted-by":"crossref","unstructured":"Blair JRS, Peyton B (1993) An introduction to chordal graphs and clique trees. Graph Theory Sparse Matrix Comput 56:1\u201329","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"507_CR11","doi-asserted-by":"crossref","unstructured":"Bonnot F, Gu\u00e9noche A, Perrier X (1996) Properties of an order distance associated with a tree distance. In: Diday E et al (eds) Proceedings of OSDA'95 (Ordinal and Symbolic Data Analysis), Springer Berlin Heidelberg New York 252\u2013261","DOI":"10.1007\/978-3-642-61159-9_22"},{"key":"507_CR12","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt A, Le VB, Spinrad J (1999) Graph classes \u2013 a survey. SIAM monographs on discrete mathematics and applications","DOI":"10.1137\/1.9780898719796"},{"key":"507_CR13","unstructured":"Buneman P (1971) The recovery of trees from measures of dissimilarity. Mathematics in the archeological and historical sciences. Edinburgh University Press, 387\u2013395"},{"key":"507_CR14","doi-asserted-by":"crossref","unstructured":"Buneman P (1974) A characterization of rigid circuit graphs. Discrete Math 9:205\u2013212","DOI":"10.1016\/0012-365X(74)90002-8"},{"key":"507_CR15","doi-asserted-by":"crossref","unstructured":"Coleman TF (1988) A chordal preconditioner for large-scale optimization. Appl Math 40:265\u2013287","DOI":"10.1007\/BF01580736"},{"key":"507_CR16","doi-asserted-by":"crossref","unstructured":"Dearing PM, Shier DR, Warner DD (1988) Maximal chordal subgraphs. Discrete Appl Math 20:181\u2013190","DOI":"10.1016\/0166-218X(88)90075-3"},{"key":"507_CR17","unstructured":"Erd\u00f6s P, Laskar R (1983) On maximum chordal subgraph. Cong Numerantium 39:367\u2013373"},{"key":"507_CR18","unstructured":"Garetta H, Gu\u00e9noche A (2001) How confident can we be that a tree representation is good? (Quelle confiance accorder \u00e0 une repr\u00e9sentation arbor\u00e9e?). In: Gascuel O, Sagot M-F (eds) Proceedings of JOBIM 2000, LNCS, vol 2066 Springer Berlin Heidelberg, New York pp 45\u201356"},{"key":"507_CR19","doi-asserted-by":"crossref","unstructured":"G\u00e0vril F (1974) The intersection graphs of subtrees of trees are exactly the chordal graphs. J Comb Theory B, 16:47\u201356","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"507_CR20","doi-asserted-by":"crossref","unstructured":"Golumbic MC (1980) Algorithmic graph theory and perfect graphs. Academic Press New York","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"507_CR21","doi-asserted-by":"crossref","unstructured":"Gu\u00e9noche A (1998) Ordinal properties of tree distances. Discrete Appl Math 192:103\u2013117","DOI":"10.1016\/S0012-365X(98)00068-5"},{"key":"507_CR22","doi-asserted-by":"crossref","unstructured":"Hayward R, Ho\u00e0ng C, Maffray F (1989) Optimizing weakly triangulated graphs. Graphs Comb 5:339\u2013349","DOI":"10.1007\/BF01788689"},{"key":"507_CR23","doi-asserted-by":"crossref","unstructured":"Hein J (1989) An optimal algorithm to reconstruct trees from additive distance data. Bull Math Biol 51(5):597\u2013603","DOI":"10.1007\/BF02459968"},{"key":"507_CR24","doi-asserted-by":"crossref","unstructured":"Huson D, Nettles S, Warnow T (1999) Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. In: Proceedings of RECOMB'99, Lyon (France), 198\u2013207","DOI":"10.1145\/299432.299484"},{"key":"507_CR25","unstructured":"Ibarra L (2000) Fully dynamic algorithms for chordal graphs and split graphs. Technical report, University of Victoria DCS-262-IR"},{"key":"507_CR26","unstructured":"Kearney P, Hayward R, Meijer H (1997) Inferring evolutionary trees from ordinal data. In: Proceedings of eighth annual ACM-SIAM symposium on Discrete Algorithms (SODA'97) 418\u2013426"},{"key":"507_CR27","doi-asserted-by":"crossref","unstructured":"Rose D, Tarjan RE, Lueker G (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5:146\u2013160","DOI":"10.1137\/0205021"},{"key":"507_CR28","doi-asserted-by":"crossref","unstructured":"Spinrad J, Sritharan R (1995) Algorithms for weakly triangulated graphs. Discrete Appl Math 59:181\u2013191","DOI":"10.1016\/0166-218X(93)E0161-Q"},{"key":"507_CR29","doi-asserted-by":"crossref","unstructured":"Walter JR (1978) Representations of Chordal Graphs as Subtrees of a Tree. J Graph Theory 2:265\u2013267","DOI":"10.1002\/jgt.3190020311"},{"key":"507_CR30","doi-asserted-by":"crossref","unstructured":"Xue J (1994) Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks 24:109\u2013120","DOI":"10.1002\/net.3230240208"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0507-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-005-0507-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-005-0507-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T15:26:52Z","timestamp":1586273212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-005-0507-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,7]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s00500-005-0507-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6,7]]}}}