A new tight upper bound on the transposition distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3692 LNBI, Issue , 2005, Pages 216-227

  Labarre, Anthony ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; IDENTIFICATION (CONTROL SYSTEMS); LINEAR NETWORK ANALYSIS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

PERMUTATION; TIGHT UPPER BOUND; TRANSPOSITION DISTANCE;

COMPUTATION THEORY;

EID: 33646189464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_18     Document Type: Conference Paper

References (14)

1. Meidanis, J., Setubal, J.: Introduction to Computational Molecular Biology. Brooks-Cole (1997)
2. Pevzner, P.A.: Computational molecular biology. MIT Press, Cambridge, MA (2000)
3. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11 (1998) 224-240 (electronic)
4. Elias, I., Harlman, T.: A 1.375-Approximation Algorithm for Sorting by Transpositions (2005) Submitted.
5. Christie, D.A,: Genome Rearrangement Problems. PhD thesis, University of Glasgow, Scotland (1998)
6. Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Combinatorial pattern matching. Volume 2676 of Lecture Notes in Computer Science. Springer, Berlin (2003) 156-169
7. Guyer, S.A., Heath, L.S., Vergara, J.P.: Subsequence and run heuristics for sorting by transpositions. In: Fourth DIMACS Algorithm Implementation Challenge, Rutgers University (1995)
8. Vergara, J.P.C.: Sorting by Bounded Permutations. PhD thesis, Virginia Polytechnic Institute, Blacksburg, Virginia, USA (1997)
9. Walter, M.E.M.T., Curado, L.R.A.F., Oliveira, A.G.: Working on the problem of sorting by transpositions on genome rearrangements. In: Combinatorial pattern matching. Volume 2676 of Lecture Notes in Computer Science. Springer, Berlin (2003) 372-383
10. Dias, Z., Meidanis, J.: An Alternative Algebraic Formalism for Genome Rearrangements. Comparative Genomics (2000) 213-223
11. Dias, Z., Meidanis, J.: Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy. In: Proceedings of SPIRE'2001 - String Processing and Information Retrieval, Laguna de San Rafael, Chile (2001) 250-253
12. Dias, Z., Meidanis, J., Walter, M.E.M.T.: A New Approach for Approximating The Transposition Distance. In: Proceedings of SPIRE'2000 - String Processing and Information Retrieval, La Coruna, Espagne (2000)
13. Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wästlund, J.: Sorting a bridge hand. Discrete Mathematics 241 (2001) 289-300 Selected papers in honor of Helge Tverberg.
14. Hultman, A.: Toric Permutations. Master's thesis, Dept. of Mathematics, KTH, Stockholm, Sweden (1999)