Indexing similar DNA sequences

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

Volumn 6124 LNCS, Issue , 2010, Pages 180-190

  Huang, Songbo ^a   Lam, T W ^a   Sung, W K ^b   Tam, S L ^a   Yiu, S M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC OPERATION; GENETIC VARIATION; GENOMIC SEQUENCE; MEMORY REQUIREMENTS; R-SEQUENCES; SEARCHING TIME; TOTAL LENGTH;

ALGORITHMS; DATA STRUCTURES; INDEXING (OF INFORMATION); NUCLEIC ACIDS;

DNA SEQUENCES;

EID: 79956310837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14355-7_19     Document Type: Conference Paper

References (14)

1. Briniza, D., He, J., Zelikovsky, A.: Combinatorial search methods for multi-SNP disease association. In: EMBS, pp. 5802-5805 (2006). (Pubitemid 46521237)
2. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, California (1994).
3. Emahazion, T., Feuk, L., Jobs, M., Sawyer, S.L., Fredman, D., Clair, D.S., Prince, J.A., Brookes, A.J.: SNP association studies in Alzheimer's disease highlight problems for complex disease analysis. Trends in Genetics 17(7), 407-413 (2001). (Pubitemid 32545387)
4. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390-398 (2000). (Pubitemid 32075908)
5. Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: SODA, pp. 269-278 (2001).
6. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: STOC, pp. 397-406 (2000).
7. Gusfield, D.: Algorithms on strings, trees, and sequences. Cambridge University Press, Cambridge (1997).
8. Kao, M.-Y. (ed.): Encyclopedia of Algorithms. Springer, Heidelberg (2008).
9. Lam, T.W., Sung, W.K., Tam, S.L., Wong, C.K., Yiu, S.M.: Compressed indexing and local alignment of DNA. Bioinformatics 24(6), 791-797 (2008). (Pubitemid 351386917)
10. Lippert, R.A.: Space-efficient whole genome comparisons with Burrows-Wheeler transforms. Journal of Computational Biology 12(4), 407-415 (2005). (Pubitemid 40696479)
11. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12(1), 40-66 (2005).
12. Mäkinen, V., Navarro, G., Sirén, J., Välimäki, N.: Storage and retrieval of individual genomes. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 121-137. Springer, Heidelberg (2009).
13. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Computational Geometry: Theory and Applications 42(4), 342-351 (2009).
14. Szpankowski, W.: Probabilistic analysis of generalized suffix trees. In: CPM, pp. 1-14 (1992).