Maximal sub-triangulation in pre-processing phylogenetic data

DOI10.1007/S00500-005-0507-7zbMATH Open1096.68682OpenAlexW2007935999MaRDI QIDQ2500753FDOQ2500753

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

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

zbMATH Keywords

evolutionary tree

Mathematics Subject Classification ID

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

Cites Work

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

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)