Large edit distance with multiple block operations

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

Volumn 2857, Issue , 2003, Pages 369-377

  Shapira, Dana ^a   Storer, James A ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BLOCK OPERATIONS; CONSTANT FACTORS; EDIT DISTANCE; FACTOR APPROXIMATION ALGORITHMS; NEAREST NEIGHBORS; NP COMPLETE; NP-HARD; SLIDING WINDOW METHODS;

APPROXIMATION ALGORITHMS;

EID: 0142249968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39984-1_29     Document Type: Article

References (18)

1. V. BAFNA AND P. A. PEVZNER [1998]. "Sorting by Transpositions", SIAM Journal Discrete Mathematics 11:2, 124-240.
2. V. BAFNA AND P. A. PEVZNER [1993]. "Genome Rearrangements and Sorting by Reversals", IEEE Sym. on Foundations of Computer Science, 148-157.
3. G. CORMODE, M. PATERSON, S. C. SAHINALP AND U. VISHKIN [2000]. "Communication Complexity of Document Exchange", SODA, 197-206.
4. G. CORMODE AND S. MUTHUKRISHNAN [2002]. "The String Edit Distance Problem with Moves", SODA, 667-676.
5. D. DURAND, M. FARACH, R. RAVI AND M. SINGH [1997]. "A Short Course in Computational Molecular Biology", DIMACS Technical Report 97-63.
6. F. ERGUN, S. MUTHUKRISHNAN AND S. C. SAHINALP [2003]. "Comparing Sequences with Segment Rearrangements", DIMACS Technical Report.
7. S. HANNENHALLI [1996]. "Polynomial-Time Algorithm for Computing Translocation Distance Between Genomes", CPM, 162-176.
8. D. LOPRESTI AND A. TOMKINS [1997]. "Block Edit Models for Approximate String Matching", Theoretical Computer Science 181, 159-179.
9. W. J. MASEK AND M. S. PATERSON [1980]. "A Faster Algorithm for Computing String Edit Distances", J. Computer and System Sciences 20, 18-31.
10. S. MUTHUKRISHNAN AND SAHINALP [2000]. "Approximate Nearest Neighbors and Sequence Comparison with Block Operations", ACM STOC, 416-424.
11. S. MUTHUKRISHNAN AND SAHINALP [2002a]. "Simple and Practical Sequence Nearest Neighbors with Block Operations", CPM, 262-278.
12. S. MUTHUKRISHNAN AND SAHINALP [2002b]. "An Improved Algorithm for Sequence Comparison with Block Reversals", Latin, 372-386.
13. D. SHAPIRA AND J. A. STORER [2002]. "Edit Distance with Move Operations", CPM, 85-98.
14. D. SHAPIRA AND J. A. STORER [2003a]. "In-Place Differential File Compression", DCC, 263-272.
15. D. SHAPIRA AND J. A. STORER [2003b]. "Edit Distance with Multiple Block Operations", Technical Report CS-03-236.
16. T. F. SMITH AND M. S. WATERMAN [1981]. "Identification of Common Molecular Sequences", Journal of Molecular Biology 147, 195-197.
17. W. F. TICHY [1984]. "The String to String Correction Problem with Block Moves", ACM Transactions on Computer Systems 2:4, 309-321.
18. M. VINGRON AND M. S. WATERMAN [1994]. "Sequence Alignment and Penalty Choice", Journal of Molecular Biology, 235, 1-12 .