HP Distance Via Double Cut and Join Distance

DOI10.1007/978-3-540-69068-9_8MaRDI QIDQ3506942zbMATH OpenOpenAlexFDO

Authors Anne Bergeron, Julia Mixtacki, Jens Stoye

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_8

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A new linear time algorithm to compute the genomic distance via the double cut and join distance
• Computing the rearrangement distance of natural genomes
• Distribution of genome rearrangement distance under double cut and join
• The genesis of the DCJ formula
• Balanced vertices in trees and a simpler algorithm to compute the genomic distance

Cites work

• Combinatorial Pattern Matching
• Efficient algorithms for multichromosomal genome rearrangements.
• Genome rearrangements: a correct algorithm for optimal capping
• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• scientific article; zbMATH DE number 1786450 (Why is no real title available?)
• On the similarity of sets of permutations and its applications to genome comparison

Cited in

(8)

• A new linear time algorithm to compute the genomic distance via the double cut and join distance
• A mean first passage time genome rearrangement distance
• Distribution of genome rearrangement distance under double cut and join
• The genesis of the DCJ formula
• Computing the rearrangement distance of natural genomes
• On the class of double distance problems
• A linear time algorithm for an extended version of the breakpoint double distance
• Algebraic double cut and join: A group-theoretic approach to the operator on multichromosomal genomes

This page was built for publication: HP Distance Via Double Cut and Join Distance

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