Simple and practical sequence nearest neighbors with block operations

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

Volumn 2373, Issue , 2002, Pages 262-278

  Muthu Muthukrishnan, S ^a   Cenk Sahinalp S ^b  

^a Dept of CS Rutgers University and ATand T Labs Research   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; NEAREST NEIGHBOR SEARCH; PATTERN MATCHING; QUERY PROCESSING;

APPROXIMATION RATIOS; COMBINED DATA STRUCTURE; DISTANCE ESTIMATORS; EFFICIENT DATA STRUCTURES; EVOLUTIONARY MECHANISMS; EXPERIMENTAL EVALUATION; PREPROCESSING TIME; SEQUENCE COMPARISONS;

HAMMING DISTANCE;

EID: 84937440363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_22     Document Type: Conference Paper

References (19)

1. A. N. Arslan, O. Egecioglu, P. A. Pevzner A new approach to sequence comparison: normalized sequence alignment, Proceedings of RECOMB 2001.
2. Bailey J.A., Yavor A.M., Massa H.F., Trask B.J., Eichler E.E., Segmental duplications: organization and impact within the curren t human genome project assembly, Genome Research 11(6), Jun 2001.
3. G. Cormode, M. Paterson, S. C. Sahinalp and U. Vishkin. Communication Complexity of Document Exchange. Proc. ACM-SIAM Symp. on Discrete Algorithms, 2000.
4. G. Cormode, S. Muthukrishnan, S. C. Sahinalp. Permutation editing and matching via Embeddings. Proc. ICALP, 2001.
5. Feng D.F., Doolittle R.F., Progressive sequence alignment as a prerequisite to co rrect p hyl ogenetic trees, J Mol Evol. 1987;25(4):351-60.
6. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Remving the Curse of Dimensionality. Proc. ACM Symp. on Theory of Computing, 1998, 604–613.
7. Jackson, Strachan, Dover, Human Genome Evolution, Bios Scientific Publishers, 1996.
8. Y. Ji, E. E. Eichler, S. Schwartz, R. D. Nicholls, Structure of Chromosomal Duplications and their Role in Mediating Human Genomic Disorders, Genome Research 10, 2000.
9. E. Kushilevitz, R. Ostrovsky and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proc. ACM Symposium on Theory of Computing, 1998, 614–623.
10. D. Lopresti and A. Tomkins. Block edit models for approximate string matching. Theoretical Computer Science, 1996.
11. S. Muthukrishnan and S. C. Sahinalp, Approximate nearest neighbors and sequence comparison with block operations Proc. ACM Symposium on Theory of Computing, 2000.
12. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Cybernetics and Control Theory, 10(8):707-710, 1966.
13. V. Bafna, P. A. Pevzner, Sorting by transpositions. SIAM J. Discrete Math, 11, 224-240, 1998.
14. D. Shapira and J. Storer, Edit distance with move operations,t Proceedings of CPM, (2002).
15. S. C. Sahinalp and U. Vishkin, Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm, Proceedings of IEEE Symposium on Foundations of Computer Science, (1996).
16. George P. Smith Evolution of Repeated DNA Sequences by Unequal Crossover, Science, vol 191, pp 528–535.
17. J. D. Thompson, D. G. Higgins, T. J. Gibson, Clustal-W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice, Nucleic Acid Research 1994, Vol. 22, No. 22.
18. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, Journal of Computational Biology, 1:337–348, 1994.
19. C. Venter, The sequence of the human genome, Science, 16:291, Feb 2001.