A survey of the research on similarity query technique of sequence data

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 47, Issue 2, 2010, Pages 264-276

  Zhu, Yangyong ^a   Dai, Dongbo ^a   Xiong, Yun ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

Distance distribution; Filtering technique; Sequence data; Similarity metric; Similarity query

Indexed keywords

APPLICATION FIELDS; BIOLOGICAL DATABASE; DISTANCE DISTRIBUTIONS; FILTERING TECHNIQUE; HOT RESEARCH TOPICS; KEY ISSUES; KEY TECHNIQUES; LARGE-SCALE DATASETS; LARGE-SCALE SEQUENCES; QUERY ALGORITHMS; RANDOM SEQUENCE; RESEARCH TRENDS; SCIENTIFIC COMPUTING; SEQUENCE DATA; SEQUENCE SIMILARITY; SIMILARITY METRICS; SIMILARITY QUERY; STATISTICAL INFORMATION; WEB ACCESS;

SURVEYS;

RESEARCH;

EID: 77950577191     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (77)

1. Dong G Z, Pei J. Sequence Data Mining[M]. Berlin: Springer, 2007
2. Sarawagi S. Advanced Methods for Knowledge Discovery from Complex Data[M]. Berlin: Springer, 2005
3. Zhu Yangyong, Xiong Yun. DNA sequence data mining technique[J]. Journal of Software, 2007, 18(11): 2766-2781 (in Chinese)
4. Hand D, Mannila H, Smyth P. Principles of Data Mining[M]. Cambridge, MA: MIT Press, 2001
5. Brejova B, DiMarco C, Vinar T, et al. Finding Patterns in Biological Sequences, CS-2000-22[R]. Ontario: University of Waterloo, 2000
6. Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases[C] //Lomet D B. Proc of the 4th Int Conf on Foundations of Data Organization and Algorithms (FODO '93). Berlin: Springer, 1993: 69-84
7. Babcock B, Babu S, Datar M, et al. Models and issues in data stream systems[C] //Popa L. Proc of the 21st ACM SIGART-SIGMOD-SIGART Symp on Principles of Database System(PODS). New York: ACM, 2002: 1-16
8. Gusfield D. Algorithms on Strings, Trees, and Sequences[M]. New York: Cambridge Press, 1997
9. Dayhoff M O, Schwartz R M, Orcutt B C. A model of evolutionary change in proteins[J]. National Biomedical Research Foundation, 1978, 5(3): 345-352
10. Henikoff S, Henikoff J. Amino acid substitution matrices from protein blocks[J]. Proc of the National Academy Sciences of the United States of America (PNAS), 1992, 89(22): 10915-10919
11. Muthukrishnan S, Sahinalp S. Approximate nearest neighbors and sequence comparison with block operations[C] //Proc of the 32nd Annual ACM Symp on Theory of Computing. New York: ACM, 2000: 416-422
12. Kahveci T, Singh A K. An efficient index structure for string databases[C] //Apers P, Ceri S, Paraboschi S, et al. Proc of the 27th Int Conf on Very Large Data Bases(VLDB 2001). San Francisco: Morgan Kaufmann, 2001: 351-360
13. Wang Guoren, Ge Jian, Xu Hengyu, et al. A sequence similarity query processing technique based on two-partitioning frequency transformation[J]. Journal of Software, 2006, 17(2): 232-241 (in Chinese)
14. Ukkonen E. Approximate string matching with q-gram and maximal matching[J]. Theory Computer Science, 1992, 92(1): 191-211
15. Chvatal V, Sankoff D. Longest common subsequences of two random sequences[J]. Journal of Applied Probability, 1975, 12(2): 306-315
16. Navarro G. A guided tour to approximate string matching[J]. ACM Computing Surveys, 2001, 33(1): 31-88
17. Regnier M, Szpankowski W. On the approximate pattern occurrence in a text[C] //Proc of Compression and Complexity of Sequences. Los Alamitos: IEEE Computer Society, 1997: 253-264
18. Baeza-Yates R, Navarro G. Faster approximate string matching[J]. Algorithmica, 1999, 23(2): 127-158
19. National center for biotechnology information. genbank database[OL]. [2008-01-23]. http://www.ncbi.nlm.nih.gov/
20. Boyer R S, Moore J S. A fast string searching algorithm[J]. Communications of the ACM, 1977, 20(10): 762-772
21. Knuth D, Moris J H, Pratt V. Fast pattern matching in strings[J]. SIAM Journal on Computing, 1977, 6(2): 323-350
22. Hunt E, Atkinson M P, Irving R W. A database index to large biological sequences[C] //Appers P, Atzeni P, Ceri S, et al. Proc of the VLDB. San Francisco: Morgan Kaufmann, 2001: 139-148
23. Fogla P, Lee Wenke. q-gram matching using tree models[J]. IEEE Trans on Knowledge and Data Engineering, 2006, 18(4): 433-447
24. Aho A V, Corasick M J. Efficient string matching: An aid to bibliographic search[J]. Communications of the ACM, 1975, 18(6): 333-340
25. Tuck N, Sherwood T, Calder B, et al. Deterministic memory efficient string matching algorithms for intrusion detection[C] //Li V O K. Proc of the IEEE INFOCOM 2004. Piscataway: IEEE, 2004: 333-340
26. Wang Yongcheng, Shen Zhou, Xu Yizhen. Improved algorithms for matching multiple patterns[J]. Journal of Computer Research and Development, 2002, 39(1): 55-60 (in Chinese)
27. Baeza-Yates R, Gonnet G. A new approach to text searching[J]. Communications of the ACM, 1992, 35(10): 74-82
28. Wu S, Manber U. Fast text searching allowing errors[J]. Communications of the ACM, 1992, 35(10): 83-91
29. Kida T, Takeda M, Shinohara A, et al. Shift-And approach to pattern matching in LZW compressed text[G]. //LNCS 1645: Proc of the 10th Annual Symp on Combinational Pattern Matching. Berlin: Springer, 1999: 1-13
30. Karp R, Rabin M. Efficient randomized pattern matching algorithms[J]. IBM Journal of Research and Development, 1987, 31(2): 249-260
31. Muthukrishnan S. Detecting false matches in string matching algorithms[G] //LNCS 684: Proc of the 4th Annual Symp on Combinational Pattern Matching. Berlin: Springer, 1993: 164-178
32. Gonnet G, Baeza-Yates. An analysis of the KarpRabin string matching algorithm[J]. Information Processing Letters, 1992, 34(5): 271-274
33. Mask W J, Paterson M S. A faster algorithm for computing string edit distances[J]. Journal of Computer and System Science, 1980, 20(1): 18-31
34. Ukkonen E. Algorithms for approximate string matching[J]. Information and Control, 1985, 64(3): 100-118
35. Myers E. An O(ND) difference algorithm and its variations[J]. Algorithmica, 1986, 1(1): 251-266
36. Meek C, Patel J M, Kasetty S. OASIS: An online and accurate technique for local-alignment searches on biological sequences[C] //Freytag J C, Lockemann P C, Abiteboul S, et al. Proc of the 29th Int Conf on Very Large Data Bases(VLDB 2003). San Francisco: Morgan Kaufmann, 2003: 910-921
37. Altschul S F, Gish W, Miller W, et al. Basic local alignment search tool[J]. Journal of Molecular Biology, 1990, 215(3): 403-410
38. Sun H, Ozturk O, Ferhatosmanoglu H. CoMRI: A compressed multi-resolution index structure for sequence similarity queries[C] //Proc of the Computational Systems Bioinformatics (CSB). Los Alamitos: IEEE Computer Society, 2003: 553-559
39. Sheu S, Chang A, Huang W. Fast similarity search in string databases[C] //Proc of the 19th Int Conf on Advanced Information Networking and Applications (AINA). Los Alamitos: IEEE Computer Society, 2005: 617-622
40. Yianilos P N. Data structures and algorithms for nearest neighbor search in general metric spaces[C] //Proc of the 4th Annual ACM-SIAM Symp on Discrete Algorithms (SODA). Austin: Society for Industrial and Applied Mathematics (SIAM), 1993: 311-321
41. Ciaccia P, Patella M, Zezula P. M-Tree: An efficient access method for similarity search in metric spaces[C] //Jarke M, Carey M J, Dittrich K R, et al. Proc of the 23rd Int Conf on Very Large Data Bases (VLDB'97). San Francisco: Morgan Kaufmann, 1997: 426-435
42. Sahinalp S C, Tasan M, Macker J, et al. Distance based indexing for string proximity search[C] //Dayal U, Ramamritham K, Vijayaraman. Proc of the 19th Int Conf on Data Engineering(ICDE). Los Alamitos: IEEE Computer Society, 2003: 125-136
43. Venkateswaran J, Lachwani D, Kahveci T, et al. Reference-based indexing of sequence databases[C] //Dayal U, Whang K Y, Lomet D B, et al. Proc of the VLDB. New York: ACM, 2006: 906-917
44. Venkateswaran J, Kahveci T, Jermaine C, et al. Reference-based indexing for metric spaces with costly distance measures[J]. The VLDB Journal, 2008, 17(5): 1231-1251
45. Jokinen P, Ukkonen E. Two algorithms for approximate string matching in static texts[C] //Tarlecki A. Proc of the 16th Symp on Mathematical Foundations of Computer Science. Berlin: Springer, 1991: 240-248
46. Burkhardt S, Crauser A, Ferragina P. q-gram based database searching using a suffix array(QUASAR)[C] //Proc of the 3rd Annual Int Conf on Research in Computational Molecular Biology (RECOMB). New York: ACM, 1999: 77-83
47. Gravano L, Ipeirotis P, Jagadish H V, et al. Approximate string joins in a database (Almost) for free[C] //Appers P, Atzeni P, Ceri S, et al. Proc of the VLDB. San Francisco: Morgan Kaufmann, 2001: 491-500
48. Li C, Lu J H, Lu Y M. Efficient merging and filtering algorithms for approximate string searches[C] //Proc of the 24th Int Conf on Data Engineering (ICDE). Los Alamitos: IEEE Computer Society, 2008: 257-266
49. Xiao C, Wang W, Lin X M. Ed-Jion: An efficient algorithm for similarity joins with edit distance constraints[C] //Proc of the 34th Int Conf on Very Large Data Bases(VLDB). Trondheim, Norway: VLDB Endowment, 2008: 933-944
50. Sutinen E, Tarhio J. On using g-gram locations in approximate string matching[C] //Spirakis P G. Proc of the 3rd Annual European Symp on Algorithms. Berlin: Springer, 1995: 327-340
51. Califano A, Rigoutsos I. FLASH: A fast look-up algorithm for string homology[C] //Hunter L, Searls D B, Shavlik W S. Proc of the 1st Int Conf on Intelligent Systems for Molecular Biology. Bethesda: AAAI Press, 1993: 54-64
52. Ma Bin, Tromp J, Li Ming. PatternHunter: Faster and more sensitive homology search[J]. Bioinformatics, 2002, 18(3): 440-445
53. Burkhardt S, Karkkainen J. Better filtering with gapped q-grams[C] //Amir A, Landau G M. Proc of the 12th Annual Symp on Combinatorial Pattern Matching(CPM). Berlin: Springer, 2001: 73-85
54. Li C, Wang B, Yang X C. VGRAM: Improving performance of approximate queries on string collections using variable-length grams[C] //Koch C, Gehrke J, Garofalakis M N, et al. Proc of the 33rd Int Conf on Very Large Data Bases(VLDB). New York: ACM, 2007: 303-314
55. Yang X C, Wang B, Li C. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently[C] //Wang J T L. Proc of the ACM SIGMOD Int Conf on Management of Data (SIGMOD 2008). New York: ACM, 2008: 353-364
56. Cormode G. Sequence distance embeddings[D]. Coventry: University of Warwick, 2003
57. Bourgain J. On Lipschitz embedding of finite metric spaces in Hilbert space[J]. Israel Journal of Mathematics, 1985, 52(1-2): 46-52
58. Faloutsos C, Lin D I. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets[C] //Carey M J, Schneider D A. Proc of the 1995 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 1995: 163-174
59. Wang X, Wang J T L, Lin K I, et al. An index structure for data mining and clustering[J]. Knowledge and Information Systems, 2000, 2(1): 161-184
60. Hristescu G, Farach-Colton M. Cluster-preserving embedding of proteins, 99-50[R]. New Brunswick: Rutegers University, 1999
61. Hjaltason G R, Samet H. Contractive embedding methods for similarity searching in metric spaces, CS-TR-4102[R]. College Park: University of Maryland, 2000
62. Indyk P. Tutorial: Algorithmic applications of low-distortion geometric embeddings[C] //Proc of the 42nd Annual Symp on Foundations of Computer Science(FOCS). Los Alamitos: IEEE Computer Society, 2001: 10-33
63. Batu T, Ergun F, Kilian J, et al. A sublinear algorithm for weakly approximating edit distance[C] //Proc of the 35th Annual ACM Symp on Theory of Computing(STOC). New York: ACM, 2003: 316-324
64. Muthukrishnan S, Sahinalp S. Approximate nearest neighbors and sequence comparison with block operations[C] //Proc of the 32nd Annual ACM Symp on Theory of Computing. New York: ACM, 2000: 416-422
65. Ostrovsky R, Rabani Y. Low distortion embeddings for edit distance[J]. Journal of the ACM, 2007, 54(5): 1-16
66. Halperin E, Buhler J, Karp R, et al. Detecting protein sequence conservation via metric embeddings[J]. Bioinformatics, 2003, 19(Suppl1): 122-129
67. Eskin E, Snir S. The homology kernel: A biologically motivated sequence embedding into Euclidean space[C] //Proc of the 2005 IEEE Symp on Computational Intelligence in Bioinformatics and Computational Biology(CIBCB'05). Los Alamitos: IEEE Computer Society, 2005: 179-186
68. Sacan A, Toroslu L H. Approximate similarity search in genomic sequence databases using landmark-guided embedding[C] //Proc of the 24th Int Conf on Data Engineering Workshops. Los Alamitos: IEEE Computer Society, 2008: 338-345
69. Indyk P, Motwani R. Approximate nearest neighbors: Towards removing the curse of dimensionality[C] //Proc of the 30th Annual ACM Symp on the Theory of Computing(STOC). New York: ACM, 1998: 604-613
70. Gionis A, Indyk P, Motwani R. Similarity search in high dimensions via hashing[C] //Atkinson M P, Orlowska M E, Valduriez P, et al. Proc of the 25th Int Conf on Very Large Data Bases(VLDB). San Francisco: Morgan Kaufmann, 1999: 518-529
71. Buhler J. Efficient large-scale sequence comparison by locality-sensitive hashing[J]. Bioinformatics, 2001, 17(5): 419-428
72. Buhler J, Tompa M. Finding motifs using random projection[J]. Journal of Computational Biology, 2002, 9(2): 225-242
73. Buhler J. Probably sensitive indexing strategies for biosequence similarity search[C] //Proc of the 6th Annual Int Conf on Computational Biology (RECOMB). New York: ACM, 2002: 90-99
74. ]Narayanan M, Karp R M. Gapped local similarity search with provable guarantees[C] //Jonassen I, Kim J. Proc of the 4th Int Workshop on Algorithms in Bioinformatics (WABI). Berlin: Springer, 2004: 74-86
75. Athitsos V, Potamias M, Papapetrou P, et al. Nearest neighbor retrieval using distance-based hashing[C] //Proc of the 24th Int Conf on Data Engineering (ICDE). Los Alamitos, CA: IEEE Computer Society, 2008: 327-336
76. Jiang K, Thosen O, Peters A, et al. An efficient parallel implementation of the hidden Markov methods for genomic sequence search on a massively parallel system[J]. IEEE Trans on Parallel and Distributed Systems, 2008, 19(1): 15-23
77. Manavski S A, Valle G. CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment[J]. BMC Bioinformatics, 2008, 9(Suppl 2): S10