Working on the problem of sorting by transpositions on genome rearrangements

DOI10.1007/3-540-44888-8_27zbMATH Open1279.92067OpenAlexW1553134725MaRDI QIDQ3550849FDOQ3550849

Authors: Maria Emilia Machado Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira 

Publication date: 6 April 2010

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

Full work available at URL: https://doi.org/10.1007/3-540-44888-8_27

Recommendations

• Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
• Extension of the Bafna-Pevzner theory for the transposition sorting problem
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• An approximation algorithm for sorting by reversals and transpositions
• Research in Computational Molecular Biology

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Searching and sorting (68P10)

Cited In (7)

• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• Sorting by Cuts, Joins and Whole Chromosome Duplications
• Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• Extension of the Bafna-Pevzner theory for the transposition sorting problem
• Multi-break rearrangements and chromosomal evolution
• A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions

This page was built for publication: Working on the problem of sorting by transpositions on genome rearrangements

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