Maximal sub-triangulation in pre-processing phylogenetic data

DOI10.1007/s00500-005-0507-7zbMath1096.68682OpenAlexW2007935999MaRDI QIDQ2500753

Alain Sigayret, Christine Sinoquet, Anne Berry

Publication date: 18 August 2006

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-005-0507-7

zbMATH Keywords

evolutionary tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10)

Related Items (4)

A vertex incremental approach for maintaining chordality ⋮ Symmetric graph-theoretic roles of two-pairs and chords of cycles ⋮ Intersection representations of matrices by subtrees and unicycles on graphs ⋮ 3D-interval-filament graphs

Cites Work

• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
• Maximal chordal subgraphs
• An optimal algorithm to reconstruct trees from additive distance data
• A chordal preconditioner for large-scale optimization
• Inferring evolutionary trees with strong combinatorial evidence
• Ordinal properties of tree distances
• Optimizing weakly triangulated graphs
• A characterisation of rigid circuit graphs
• Algorithms for weakly triangulated graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
• Fully dynamic algorithms for chordal graphs and split graphs
• Algorithms and Computation
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal sub-triangulation in pre-processing phylogenetic data