scientific article; zbMATH DE number 1786450
From MaRDI portal
Publication:4547739
zbMATH Open0990.68050MaRDI QIDQ4547739FDOQ4547739
Authors: Anne Bergeron 
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890106
Title of this publication is not available (Why is that?)
Recommendations
Cited In (18)
- \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
- Sorting signed permutations by reversals, revisited
- Reconstructing an ancestral genome using minimum segments duplications and reversals.
- A very elementary presentation of the Hannenhalli-Pevzner theory
- Aligning and Labeling Genomes under the Duplication-Loss Model
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- Combinatorial Pattern Matching
- HP Distance Via Double Cut and Join Distance
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- A topological framework for signed permutations
- Short topological decompositions of non-orientable surfaces
- A new linear time algorithm to compute the genomic distance via the double cut and join distance
- Reversal and transposition medians
- A new characterization of \(\mathcal{V} \)-posets
- Comparing bacterial genomes from linear orders of patterns
- Improved bounds on sorting by length-weighted reversals
- Uniquely pressable graphs: characterization, enumeration, and recognition
- On maximal instances for the original syntenic distance
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)
