Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315321zbMATH OpenFDO

Authors Eric Tannier, Marie-France Sagot

Publication date 7 September 2005

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

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10)

Recommendations

• Advances on sorting by reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Sorting signed permutations by reversals, revisited
• scientific article; zbMATH DE number 1947393

Cited in

(26)

• An approximation algorithm for sorting by reversals and transpositions
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Heuristics for the sorting signed permutations by reversals and transpositions problem
• Sorting by reversals and the theory of 4-regular graphs
• Sorting signed permutations by reversals using link-cut trees
• Sorting signed permutations by reversals, revisited
• A 1.375-approximation algorithm for unsigned translocation sorting
• Replacement sort revisited: The ``gold standard unearthed!
• Pattern matching with non overlapping reversals -- approximation and on-line algorithms
• A faster algorithm for genomic sorting problem
• A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
• Efficient data structures and a new randomized approach for sorting signed permutations by reversals
• Parallel algorithms for the reversal distance of permutations on PRAM and LARPBS
• Average-Case Analysis of Perfect Sorting by Reversals
• scientific article; zbMATH DE number 1301598 (Why is no real title available?)
• A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
• scientific article; zbMATH DE number 1945172 (Why is no real title available?)
• scientific article; zbMATH DE number 1830749 (Why is no real title available?)
• Experiments in Computing Sequences of Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• A retrospective on genomic preprocessing for comparative genomics
• Algorithms – ESA 2005
• Polynomial-time sortable stacks of burnt pancakes
• Can the 1.375 approximation ratio of unsigned genomes distances be improved?
• Advances on sorting by reversals
• A more efficient algorithm for perfect sorting by reversals

This page was built for publication: Combinatorial Pattern Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315321)