An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations

DOI10.1007/11780441_24zbMath1196.68070OpenAlexW1496662839MaRDI QIDQ5307511

Michal Ozery-Flato, Ron Shamir

Publication date: 14 September 2007

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

Full work available at URL: https://doi.org/10.1007/11780441_24

Mathematics Subject Classification ID

Searching and sorting (68P10) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (3)

Sorting genomes by generalized translocations ⋮ An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations ⋮ An improved algorithm for sorting by block-interchanges based on permutation groups

This page was built for publication: An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations