Polynomial-Time Algorithm for Sorting by Generalized Translocations

DOI10.1007/978-3-642-02017-9_46MaRDI QIDQ3630229zbMATH OpenOpenAlexFDO

Authors Xiao Yin, Daming Zhu

Publication date 3 June 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_46

zbMATH Keywords

genome rearrangementtranslocation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Biochemistry, molecular biology (92C40) Problems related to evolution (92D15)

Recommendations

• Sorting genomes by generalized translocations
• Research in Computational Molecular Biology
• Polynomial-time algorithm for computing translocation distance between genomes
• A (1.408+ )-approximation algorithm for sorting unsigned genomes by reciprocal translocations
• An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations

Cited in

(7)

• Homomorphic rank sort using surrogate polynomials
• Sorting genomes by generalized translocations
• An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
• Combinatorial Pattern Matching
• Research in Computational Molecular Biology
• Polynomial-time algorithm for computing translocation distance between genomes
• An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations

This page was built for publication: Polynomial-Time Algorithm for Sorting by Generalized Translocations

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