Algorithms – ESA 2005

DOI10.1007/11561071zbMath1142.68448OpenAlexW2501059503MaRDI QIDQ5475886

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Some families of trees arising in permutation analysis ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ An \(O(n^2)\) time algorithm for the minimal permutation completion problem ⋮ Extending common intervals searching from permutations to sequences ⋮ New algorithms for text fingerprinting ⋮ A more efficient algorithm for perfect sorting by reversals ⋮ Common intervals of multiple permutations ⋮ Competitive graph searches ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs ⋮ Algorithmic aspects of a general modular decomposition theory ⋮ An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem

This page was built for publication: Algorithms – ESA 2005