Genome rearrangements: a correct algorithm for optimal capping

DOI10.1016/J.IPL.2007.04.011MaRDI QIDQ2379988zbMATH OpenOpenAlexFDO

Authors Géraldine Jean, Macha Nikolski

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.04.011

zbMATH Keywords

algorithmsgenomic distancegenome rearrangementsbreakpoint graphoptimal capping

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Efficient algorithms for multichromosomal genome rearrangements.
• Multi-break rearrangements and chromosomal evolution
• Research in Computational Molecular Biology
• A faster algorithm for genomic sorting problem
• Genome Rearrangements and Sorting by Reversals

Cites work

• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• Efficient algorithms for multichromosomal genome rearrangements.

Cited in

(9)

• Rearrangements in phylogenetic inference: compare, model, or encode?
• Linear algorithm for minimal rearrangement of structures
• A maximum parsimony principle for multichromosomal complex genome rearrangements
• Gene orthology inference via large-scale rearrangements for partially assembled genomes
• Balanced VCG mechanisms for sequencing problems
• Folding Variant Narrowing and Optimal Variant Termination
• HP Distance Via Double Cut and Join Distance
• A new linear time algorithm to compute the genomic distance via the double cut and join distance
• An alternative algebraic formalism for genome rearrangements

This page was built for publication: Genome rearrangements: a correct algorithm for optimal capping

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