Common intervals of trees

DOI10.1016/j.ipl.2004.09.016zbMath1170.05332OpenAlexW2053806278MaRDI QIDQ834996

Carla D. Savage, Steffen Heber

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.016

zbMATH Keywords

algorithmslabeled treescommon intervalscombinatorial problemsconsecutive arrangement problem

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Common intervals of multiple permutations

Cites Work

• Unnamed Item
• Evolution algorithms in combinatorial optimization
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Fast algorithms to enumerate all common intervals of two permutations
• On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Algorithms for Finding Gene Clusters
• Algorithms and Computation
• Incidence matrices with the consecutive 1’s property