scientific article; zbMATH DE number 1786450

MaRDI QIDQ4547739zbMATH OpenFDO

Authors Anne Bergeron

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890106

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A very elementary presentation of the Hannenhalli-Pevzner theory
• Combinatorial Pattern Matching
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Advances on sorting by reversals
• Transforming cabbage into turnip

Cited in

(18)

• On maximal instances for the original syntenic distance
• A very elementary presentation of the Hannenhalli-Pevzner theory
• Short topological decompositions of non-orientable surfaces
• Sorting signed permutations by reversals, revisited
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• A new characterization of \(\mathcal{V} \)-posets
• A new linear time algorithm to compute the genomic distance via the double cut and join distance
• Uniquely pressable graphs: characterization, enumeration, and recognition
• Aligning and Labeling Genomes under the Duplication-Loss Model
• Combinatorial Pattern Matching
• Reconstructing an ancestral genome using minimum segments duplications and reversals.
• Improved bounds on sorting by length-weighted reversals
• Reversal and transposition medians
• A topological framework for signed permutations
• HP Distance Via Double Cut and Join Distance
• Comparing bacterial genomes from linear orders of patterns
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.

This page was built for publication:

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