Maximal sub-triangulation in pre-processing phylogenetic data

DOI10.1007/S00500-005-0507-7MaRDI QIDQ2500753zbMATH OpenOpenAlexFDO

Authors Anne Berry, Alain Sigayret, Christine Sinoquet

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

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

Recommendations

• Maximal Accurate Forests from Distance Matrices
• A robust model for finding optimal evolutionary tree
• Minimal Triangulation Algorithms for Perfect Phylogeny Problems
• An optimal algorithm to reconstruct trees from additive distance data
• Computing Phylogenetic Roots with Bounded Degrees and Errors

Cites work

• scientific article; zbMATH DE number 3847425 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 53860 (Why is no real title available?)
• scientific article; zbMATH DE number 1305489 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1163862 (Why is no real title available?)
• scientific article; zbMATH DE number 1953077 (Why is no real title available?)
• scientific article; zbMATH DE number 6472617 (Why is no real title available?)
• A characterisation of rigid circuit graphs
• A chordal preconditioner for large-scale optimization
• A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms and Computation
• Algorithms for weakly triangulated graphs
• An optimal algorithm to reconstruct trees from additive distance data
• Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
• Fully dynamic algorithms for chordal graphs and split graphs
• Inferring evolutionary trees with strong combinatorial evidence
• Maximal chordal subgraphs
• Optimizing weakly triangulated graphs
• Ordinal properties of tree distances
• Recognizing weakly triangulated graphs by edge separability
• Representations of chordal graphs as subtrees of a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500753)