An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations

Michal Ozery-Flato*, Ron Shamir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We prove that sorting by reciprocal translocations can be done in O(n 3/2 √log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et, al algorithm for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron et al.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings
PublisherSpringer Verlag
Pages258-269
Number of pages12
ISBN (Print)3540354557, 9783540354550
DOIs
StatePublished - 2006
Event17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006 - Barcelona, Spain
Duration: 5 Jul 20067 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4009 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006
Country/TerritorySpain
CityBarcelona
Period5/07/067/07/06

Fingerprint

Dive into the research topics of 'An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations'. Together they form a unique fingerprint.

Cite this