HP Distance Via Double Cut and Join Distance

DOI10.1007/978-3-540-69068-9_8zbMath1143.92310OpenAlexW1523193919MaRDI QIDQ3506942

Jens Stoye, Julia Mixtacki, Anne Bergeron

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

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

Cites Work

• Efficient algorithms for multichromosomal genome rearrangements.
• Genome rearrangements: a correct algorithm for optimal capping
• On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item

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