FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465844zbMATH OpenOpenAlexFDO

Authors Pavel Pevzner, Max A. Alekseyev

Publication date 12 August 2005

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

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Recommendations

• Whole genome duplications, multi-break rearrangements, and genome halving problem
• Whole Genome Duplications and Contracted Breakpoint Graphs
• Genome Halving under DCJ Revisited
• The Reconstruction of Doubled Genomes
• A uniform theory of adequate subgraphs for the genome median, halving, and aliquoting problems

Cited in

(8)

• Reconstructing an ancestral genome using minimum segments duplications and reversals.
• A uniform theory of adequate subgraphs for the genome median, halving, and aliquoting problems
• Whole genome duplications, multi-break rearrangements, and genome halving problem
• Genome Halving under DCJ Revisited
• The Reconstruction of Doubled Genomes
• Recovery of ancestral tetraploids
• The floor is lava -- halving genomes with viaducts, piers and pontoons
• Genome halving and aliquoting under the copy number distance

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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