Algorithms – ESA 2005
From MaRDI portal
Publication:5475886
DOI10.1007/11561071zbMath1142.68448MaRDI 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
68R05: Combinatorics in computer science
92D20: Protein sequences, DNA sequences
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs, A survey of the algorithmic aspects of modular decomposition, Extending common intervals searching from permutations to sequences, Common intervals of multiple permutations, New algorithms for text fingerprinting, A more efficient algorithm for perfect sorting by reversals, Algorithmic aspects of a general modular decomposition theory, An \(O(n^2)\) time algorithm for the minimal permutation completion problem, Some families of trees arising in permutation analysis, Competitive graph searches, An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem