Bidirectional search in a string with wavelet trees

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

Volumn 6129 LNCS, Issue , 2010, Pages 40-50

  Schnattinger, Thomas ^a   Ohlebusch, Enno ^a   Gog, Simon ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AFFIX TREES; BI-DIRECTIONAL SEARCH; GENES ENCODING; GENOME ANALYSIS; HUMAN GENOMES; LARGE SPACES; MICRORNAS; SECONDARY STRUCTURES; STRUCTURAL PATTERN; WAVELET TREE;

ALGORITHMS; DATA STRUCTURES; DNA SEQUENCES; ELECTROSTATIC DISCHARGE; ENCODING (SYMBOLS); GENES; PATTERN MATCHING; PLANT EXTRACTS; RNA;

TREES (MATHEMATICS);

EID: 79956312806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13509-5_5     Document Type: Conference Paper

References (14)

1. Lee, R., Feinbaum, R., Ambros, V.: The C. elegans heterochronic gene lin-4 encodes small RNAs with antisense complementarity to lin-14. Cell 75(5), 843-854 (1993). (Pubitemid 24014542)
2. Kim, N., Nam, J.W.: Genomics of microRNA. TRENDS in Genetics 22(3), 165-173 (2006).
3. Mauri, G., Pavesi, G.: Pattern discovery in RNA secondary structure using affix trees. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 278-294. Springer, Heidelberg (2003).
4. Strothmann, D.: The affix array data structure and its applications to RNA secondary structure analysis. Theoretical Computer Science 389, 278-294 (2007). (Pubitemid 350089979)
5. Stoye, J.: Affix trees. Technical report 2000-04, University of Bielefeld (2000).
6. Maasß, M.: Linear bidirectional on-line construction of affix trees. Algorithmica 37, 43-74 (2003).
7. Manber, U., Myers, E.: Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing 22(5), 935-948 (1993).
8. Puglisi, S., Smyth, W., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2), 1-31 (2007).
9. Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Research Report 124, Digital Systems Research Center (1994).
10. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 390-398 (2000). (Pubitemid 32075908)
11. Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. ACM Symposium on the Theory of Computing, pp. 397-406. ACM Press, New York (2000).
12. Manzini, G.: The Burrows-Wheeler Transform: Theory and practice. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 34-47. Springer, Heidelberg (1999).
13. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 841-850 (2003).
14. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th Annual Symposium on Foundations of Computer Science, pp. 549-554. IEEE, Los Alamitos (1989). (Pubitemid 20726002)