Indexing factors with gaps

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

Volumn 4362 LNCS, Issue , 2007, Pages 465-474

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

^a KING'S COLLEGE LONDON   (United Kingdom)

^b BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; TEXT PROCESSING;

CONCATENATION; DIVERSE TEXT ALGORITHMIC PROBLEMS; INDEXING SCHEMES;

INDEXING (OF INFORMATION);

EID: 38149048167     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. Agarwal, P.K., Govindarajan, S., and Muthukrishnan, S.: Range Searching in Categorical Data: Colored Range Searching on Grid. In R.H. Möhring and R. Raman (eds), ESA, Springer, Lecture Notes in Computer Science 2461 (2002) 17-28
2. Allali, J. and Sagot, M.-F.: The at Most k-Deep Factor Tree. Technical Report 2004-03 (2004)
3. Alstrup, S., Brodai, G.S., and Rauhe, T.: New Data Structures for Orthogonal Range Searching. In FOCS (2000) 198-207
4. Brudno, M., Chapman, M., Göttgens, B., Batzoglou, S., and Morgenstern, B.: Fast and Sensitive Multiple Alignment of Large Genomic Sequences. BMC Bioinformatics 4 (2003) 66
5. Brudno, M., Do, C.B., Cooper, G.M., Kim, M.F., Davydov, E., Green, E.D., Sidow, A., and Batzoglou, S.: Lagan and Multi-Lagan: Efficient Tools for Large-Scale Multiple Alignment of Genomic Dna. Genome Research 13 4 (2003) 721-731
6. Crochemore, M. and Rytter, W.: Jewels of Stringology. World Scientific (2002)
7. Edgar, R.C.: Muscle: Multiple Sequence Alignment with High Accuracy and High Throughput. Nucleic Acids Research 32 5
8. Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N. Muthukrishnan, S., and Srivastava, D.: Approximate String Joins in a Database (almost) for Free. In P.M.G. Apers, P. Atzeni, S. Ceri, S. Paraboschi, K. Ramamohanarao, and R.T. Snodgrass (eds), VLDB, Morgan Kaufmann (2001) 491-500
9. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)
10. Höhl, M., Kurtz, S., and Ohlebusch, E.: Efficient Multiple Genome Alignment. In ISMB (2002) 312-320
11. Iliopoulos, C.S., McHugh, J.A.M., Peterlongo, P., Pisanti, N., Rytter, W., and Sagot, M.-F.: A First Approach to Finding Common Motifs with Gaps. Int. J. Found. Comput. Sci. 16 6 (2005) 1145-1154
12. Li, M., Ma, B., Kisman, D., and Tromp, J.: Patternhunter ii: Highly Sensitive and Fast Homology Search. Genome Informatics 14 (2003) 164-175
13. Ma, B., Tromp, J., and Li, M.: Patternhunter: Faster and More Sensitive Homology Search. Bioinformatics 18 3 (2002) 440-445
14. McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. J. ACM 23 2 (1976) 262-272
15. Michael, M., Dieterich, C., and Vingron, M.: Siteblast-Rapid and Sensitive Local Alignment of Genomic Sequences Employing Motif Anchors. Bioinformatics 21 9 (2005) 2093-2094
16. Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In SODA (2002) 657-666
17. Navarro, G., Sutinen, E., Tanninen, J., and Tarhio, J.: Indexing Text with Approximate q-Grams. In R. Giancarlo and D. Sankoff (eds), CPM, Springer, Lecture Notes in Computer Science 1848 (2000) 350-363
18. Peterlongo, P., Allali, J., and Sagot, M.-F.: The Gapped-Factor Tree. In The Prague Stringology Conference, to appear (2006)
19. Sutinen, E. and Tarhio, J.: On Using q-Gram Locations in Approximate String Matching. In P.G. Spirakis (ed.), ESA, Springer, Lecture Notes in Computer Science 979 (1995) 327-340
20. Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica 14 3 (1995) 249-260