Common intervals of multiple permutations

DOI10.1007/s00453-009-9332-1zbMath1215.68163OpenAlexW2158714730WikidataQ57435931 ScholiaQ57435931MaRDI QIDQ534763

Jens Stoye, Richard Mayr, Steffen Heber

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9332-1

zbMATH Keywords

circular permutationscommon intervals of permutationsmultichromosomal permutations

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items

Extending common intervals searching from permutations to sequences ⋮ \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations ⋮ Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints ⋮ The Potential of Family-Free Genome Comparison

Cites Work

• Unnamed Item
• Unnamed Item
• Common intervals of trees
• 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
• Algorithms for Finding Gene Clusters
• Incidence matrices with the consecutive 1’s property
• Algorithms – ESA 2005