A very elementary presentation of the Hannenhalli-Pevzner theory

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

Volumn 2089, Issue , 2001, Pages 106-117

  Bergeron, Anne ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

HANNENHALLI-PEVZNER THEORY; POLYNOMIAL ALGORITHM; POLYNOMIAL SOLUTION; SIGNED PERMUTATIONS;

POLYNOMIALS;

EID: 84956970575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_9     Document Type: Conference Paper

References (6)

1. Piotr Berman, Sridhar Hannenhalli, Fast Sorting by Reversal. CPM 1996, LNCS 1075: 168-185.
2. Alberto Caprara, Sorting by reversals is dificult. RECOMB 1997, ACM Press: 75-83.
3. Sridhar Hannenhalli, Pavel A. Pevzner, Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. JACM 46(1): 1-27 (1999).
4. Haim Kaplan, Ron Shamir, Robert Tarjan, A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29(3): 880-892 (1999).
5. Pavel Pevzner, Computational Molecular Biology, MIT Press, Cambridge, Mass., 314 p., (2000).
6. David Sankofi, Edit Distances for Genome Comparisons Based on Non-Local Operations. CPM 1992, LNCS 644,: 121-135.