Abstract
Recent advances in nucleic acid sequencing technology has motivated research into succinct text indexes to represent reference genomes that support efficient pattern matching queries. Similar sequencing technology can also produce millions of reads (patterns) derived from transcripts which need to be aligned to a reference transcriptome. A transcriptome can be modeled as a hypertext. Motivated by this application, we propose the first succinct index for hypertext. The index can model any hypertext and places no restriction on the graph topology. We also propose a new pattern matching algorithm, capable of aligning a pattern to any path in the hypertext, that is especially efficient when few nodes of the hypertext share the same text—in this important case, our algorithm is a significant improvement over all existing approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akutsu, T.: A Linear Time Pattern Matching Algorithm Between a String and a Tree. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol. 684, pp. 1–10. Springer, Heidelberg (1993)
Amir, A., Lewenstein, M., Lewenstein, N.: Pattern matching in hypertext. Journal of Algorithms 35(1), 82–99 (2000)
Barbay, J., Claude, F., Navarro, G.: Compact rich-functional binary relation representations. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 170–183. Springer, Heidelberg (2010)
Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98–109. Springer, Heidelberg (2009)
Claude, F., Navarro, G.: Self-indexed text compression using straight-line programs. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 235–246. Springer, Heidelberg (2009)
Farzan, A., Munro, J.: Succinct representations of arbitrary graphs. In: 16th Annual European Symposium on Algorithms, pp. 393–404 (2008)
Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Symposium on Foundations of Computer Science, pp. 390–398 (2002)
Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 841–850 (2003)
Horner, D., Pavesi, G., Castrignano, T., De Meo, P., Liuni, S., Sammeth, M., Picardi, E., Pesole, G.: Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing. Briefings in Bioinformatics (2009)
Jay, S., Ji, H.: Next-generation DNA sequencing. Nature Biotechnology 26(10), 1135–1145 (2008)
Lam, T.-W., Sung, W.-K., Tam, S.-L., Yiu, S.-M.: Space efficient indexes for string matching with don’t cares. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 846–857. Springer, Heidelberg (2007)
Manber, U., Wu, S.: Approximate String Matching With Arbitrary Costs for Text and Hypertext. In: IAPR International Workshop on Structural and Syntactic Pattern Recognition, pp. 22–33 (1992)
Mortazavi, A., Williams, B., McCue, K., Schaeffer, L., Wold, B.: Mapping and quantifying mammalian transcriptomes by RNA-Seq. Nature Methods 5(7), 621–628 (2008)
Navarro, G.: Improved approximate pattern matching on hypertext. Theoretical Computer Science 237(1-2), 455–463 (2000)
Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), 2 (2007)
Park, K., Kim, D.: String Matching in Hypertext. In: Symposium on Combinatorial pattern matching, p. 318 (1995)
Tam, A., Wu, E., Lam, T.-W., Yiu, S.-M.: Succinct text indexing with wildcards. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 39–50. Springer, Heidelberg (2009)
Thachuk, C.: Succincter text indexing with wildcards. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 27–40. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thachuk, C. (2011). A Succinct Index for Hypertext. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds) String Processing and Information Retrieval. SPIRE 2011. Lecture Notes in Computer Science, vol 7024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24583-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-24583-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24582-4
Online ISBN: 978-3-642-24583-1
eBook Packages: Computer ScienceComputer Science (R0)