Indexing factors with gaps

Algorithmica (New York)

Volumn 55, Issue 1, 2009, Pages 60-70

  Iliopoulos, Costas S ^a   Rahman, M Sohel ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Data structure; Gapped factor; String index; Suffix tree

Indexed keywords

ALGORITHMIC PROBLEMS; GAPPED-FACTOR; INDEXING SCHEME; QUERY TIME; STRING INDEX; STRINGOLOGY; SUB-STRINGS; SUFFIX TREE; TIME AND SPACE;

DATA STRUCTURES;

INDEXING (OF INFORMATION);

EID: 67249092614     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9141-3     Document Type: Article

References (32)

1. Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: Colored range searching on grid. In: Möhring, R.H., Raman, R. (eds.) ESA. Lecture Notes in Computer Science, vol. 2461, pp. 17-28. Springer, New York (2002)
2. Allali, J., Sagot, M.-F.: The at most k-deep factor tree. Report 2004-03, Institut Gaspard Monge, Université de Marne-la-Vallée (2004)
3. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198-207 (2000)
4. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85-96. Springer, Berlin (1985)
5. M. Brudno M. Chapman B. Göttgens S. Batzoglou B. Morgenstern 2003 Fast and sensitive multiple alignment of large genomic sequences BMC Bioinf. 4 66
6. M. Brudno C.B. Do G.M. Cooper M.F. Kim E. Davydov E.D. Green A. Sidow S. Batzoglou 2003 Lagan and multi-lagan: Efficient tools for large-scale multiple alignment of genomic dna Genome Res. 13 4 721 731 (Pubitemid 36511930)
7. Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: Babai, L. (ed.) STOC, pp. 91-100. ACM, Singapore (2004)
8. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)
9. M. Crochemore C.S. Iliopoulos M. Mohamed M.-F. Sagot 2006 Longest repeats with a block of don't cares Theor. Comput. Sci. 362 1-3 248 254 (Pubitemid 44399794)
10. R.C. Edgar 2004 Muscle: multiple sequence alignment with high accuracy and high throughput Nucleic Acids Res. 32 5 1792 1797 (Pubitemid 38832724)
11. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137-143 (1997)
12. Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate string joins in a database (almost) for free. In: Apers, P.M.G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., Snodgrass, R.T. (eds.) VLDB, pp. 491-500. Morgan Kaufmann, San Mateo (2001)
13. Gusfield, D.: Algorithms on Strings, Trees, and Sequences-Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
14. Höhl, M., Kurtz, S., Ohlebusch, E.: Efficient multiple genome alignment. In: ISMB, pp. 312-320 (2002)
15. C.S. Iliopoulos J.A.M. McHugh P. Peterlongo N. Pisanti W. Rytter M.-F. Sagot 2005 A first approach to finding common motifs with gaps Int. J. Found. Comput. Sci. 16 6 1145 1154
16. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP. Lecture Notes in Computer Science, vol. 2719, pp. 943-955. Springer, New York (2003)
17. D.K. Kim J.S. Sim H. Park K. Park 2005 Constructing suffix arrays in linear time J. Discrete Algorithms 3 2-4 126 142
18. P. Ko S. Aluru 2005 Space efficient linear time construction of suffix arrays J. Discrete Algorithms 3 2-4 143 156
19. M. Li B. Ma D. Kisman J. Tromp 2003 Patternhunter ii: Highly sensitive and fast homology search Genome Inf. 14 164 175
20. B. Ma J. Tromp M. Li 2002 Patternhunter: faster and more sensitive homology search Bioinformatics 18 3 440 445 (Pubitemid 34284945)
21. Maaß, M.G., Nowak, J.: Text indexing with errors. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM. Lecture Notes in Computer Science, vol. 3537, pp. 21-32. Springer, New York (2005)
22. M.G. Maaß J. Nowak 2007 Text indexing with errors J. Discrete Algorithms 5 4 662 681 doi:10.1016/j.jda.2006.11.001, selected papers from Combinatorial Pattern Matching (CPM) 2005, December 2007 (Pubitemid 47576793)
23. U. Manber E.W. Myers 1993 Suffix arrays: A new method for on-line string searches SIAM J. Comput. 22 5 935 948
24. E.M. McCreight 1976 A space-economical suffix tree construction algorithm J. ACM 23 2 262 272
25. M. Michael C. Dieterich M. Vingron 2005 Siteblast-rapid and sensitive local alignment of genomic sequences employing motif anchors Bioinformatics 21 9 2093 2094 (Pubitemid 40668052)
26. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: SODA, pp. 657-666 (2002)
27. Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing text with approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM. Lecture Notes in Computer Science, vol. 1848, pp. 350-363. Springer, New York (2000)
28. Peterlongo, P., Allali, J., Sagot, M.-F.: The gapped-factor tree. In: Holub, J., Zdárek, J. (eds.) Stringology, pp. 182-196. Czech Technical University, Prague (2006)
29. Rahman, M.S., Iliopoulos, C.S.: Indexing factors with gaps. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F. (eds.) SOFSEM (1). Lecture Notes in Computer Science, vol. 4362, pp. 465-474. Springer, New York (2007)
30. Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M., Smyth, W.F.: Finding patterns with variable length gaps or don't cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON. Lecture Notes in Computer Science, vol. 4112, pp. 146-155. Springer, New York (2006) (Pubitemid 44531966)
31. Sutinen, E., Tarhio, J.: On using q-gram locations in approximate string matching. In: Spirakis, P.G. (ed.) ESA. Lecture Notes in Computer Science, vol. 979, pp. 327-340. Springer, Berlin (1995)
32. E. Ukkonen 1995 On-line construction of suffix trees Algorithmica 14 3 249 260