Partial enumeration of solutions traces for the problem of sorting by signed reversals
Pages 505 - 507
Abstract
Traditional algorithms to solve the problem of sorting by signed reversals output just one optional solution while the space of optimal solutions can be huge. Algorithms for enumerating the complete set of solutions traces were developed aiming to support biologists studies of alternative evolutionary scenarios. Due to the exponential complexity of the algorithms, their practical use is limited to small permutations. In this work, we propose and evaluate three different approaches to producing a partial enumeration of the complete set of traces to transform a given permutation to another one.
References
[1]
G. Badr, K. Swenson, and D. Sankoff. Listing all parsimonius reversal sequences: New algorithms and perspectives. In E. Tannier, editor, Proceedings of the 8th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2010), volume 6398 of Lecture Notes in Bioinformatics, pages 39--49, Ottawa, Canada, October 2010. Springer-Verlag Berlin Heidelberg.
[2]
C. Baudet and Z. Dias. An improved algorithm to enumerate all traces that sort a signed permutation by reversals. In Proceedings of the 25th Symposium On Applied Computing (ACM SAC 2010), Sierre, Switzerland, March 2010. 5 pages, Bioinformatics Track.
[3]
C. Baudet and Z. Dias. Partial Enumeration of Traces of Solutions for the Problem of Sorting by Signed Reversals. Technical Report IC-11-12, Institute of Computing, University of Campinas, May 2011. In English, 20 pages.
[4]
A. Bergeron, C. Chauve, T. Hartman, and K. Saint-Onge. On the properties of sequences of reversals that sort a signed permutation. In Proceedings of the JOBIM 2002, pages 99--108, Saint Malo, 2002.
[5]
M. D. V. Braga. Exploring the Solution Space of Sorting by Reversals When Analyzing Genome Rearrangements. PhD thesis, Université Lyon 1, France, 2008.
[6]
M. D. V. Braga, M.-F. Sagot, C. Scornavacca, and E. Tannier. The solution space of sorting by reversals. In Proceedings of the International Symposium on Bioinformatics Research and Applications 2007 (ISBRA 2007), volume 4463 of Bioinformatics Research and Applications, pages 293--304. Springer Berlin/Heidelberg, 2007.
[7]
M. D. V. Braga, M.-F. Sagot, C. Scornavacca, and E. Tannier. Exploring the solution space of sorting by reversals with experiments and an application to evolution. Transactions on Computational Biology and Bioinformatics, 5(3):348--356, 2008.
[8]
P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1969.
[9]
S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46(1):1--27, January 1999.
[10]
A. C. Siepel. An algorithm to enumerate sorting reversals. Journal of Computational Biology, 10(3-4):575--597, 2003.
Index Terms
- Partial enumeration of solutions traces for the problem of sorting by signed reversals
Recommendations
Sorting signed permutations by reversals, revisited
Special issue on bioinformatics IIThe problem of sorting signed permutations by reversals (SBR) is a fundamental problem in computational molecular biology. The goal is, given a signed permutation, to find a shortest sequence of reversals that transforms it into the positive identity ...
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Reversals, transpositions and transreversals are common events in genome rearrangement. The genome rearrangement sorting problem is to transform one genome into another using the minimum number of given rearrangement operations. An integer permutation ...
The sorting index on colored permutations and even-signed permutations
We define a new statistic sor on the set of colored permutations G r , n and prove that it has the same distribution as the length function. For the set of restricted colored permutations corresponding to the arrangements of n non-attacking rooks on a ...
Comments
Information & Contributors
Information
Published In
August 2011
688 pages
ISBN:9781450307963
DOI:10.1145/2147805
- General Chairs:
- Robert Grossman,
- Andrey Rzhetsky,
- Program Chairs:
- Sun Kim,
- Wei Wang
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 2011
Check for updates
Qualifiers
- Poster
Funding Sources
Conference
BCB' 11
Sponsor:
BCB' 11: ACM International Conference on Bioinformatics, Computational Biology and Biomedicine
August 1 - 3, 2011
Illinois, Chicago
Acceptance Rates
Overall Acceptance Rate 208 of 737 submissions, 28%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 43Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in