UASMAs (Universal Automated SNP Mapping Algorithms): A set of algorithms to instantaneously map SNPs in real time to aid functional SNP discovery

Proceedings of the VLDB Endowment

Volumn 3, Issue 2, 2010, Pages 1406-1413

  Mah, James T L ^a   Poo, Danny C C ^b   Cai, Shaojiang ^b  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CONFORMAL MAPPING; DATABASE SYSTEMS;

ALIGNMENT METHODS; CURATION; EXPONENTIAL INCREASE; MAPPING ALGORITHMS; REAL TIME; RECALL AND PRECISION; STATE OF THE ART; UNIQUE CHROMOSOMES;

CHROMOSOMES;

EID: 84865541372     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/1920841.1921013     Document Type: Article

References (21)

1. Abouelhoda, M. I., Kurtz, S., and Ohlebusch, E. (2004). Replacing suffix trees with enhanced suffix arrays. J. of Discrete Algorithms, 2(1):53-86.
2. Altschul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215,403-410.
3. Barsky, M., Stege, U., Thomo, A., and Upton, C. (2008). A new method for indexing genomes using on-disk suffix trees. In CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge management, pages 649-658, New York, NY, USA. ACM.
4. Burrows, M, Wheeler., D. J. (1994). A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, California.
5. Ferragina, P. and G. Manzini. (2000). Opportunistic data structures with applications. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society.
6. Ferragina, P. and G. Manzini. (2001). An experimental study of an opportunistic index. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. Washington, D.C., United States, Society for Industrial and Applied Mathematics.
7. Grossi, R. and J. S. Vitter. (2005). Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM J. Comput. 35(2): 378-407.
8. Guttmacher, A. E. and F. S. Collins. (2002). Genomic medicine--a primer. N Engl J Med 347(19): 1512-20.
9. John Healy, Elizabeth E. Thomas, Jacob T. Schwartz, and Michael Wigler. (2003). Annotating large genomes with exact word matches. Genome Res, 13: 2306-2315.
10. Lam, T. W., W. K. Sung, et al. (2008). Compressed indexing and local alignment of DNA. Bioinformatics 24(6): 791-797.
11. Langmead, B., C. Trapnell, et al. (2009). Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol 10(3): R25.
12. Li, H, Ruan J, et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
13. Li,H. and Durbin, R. (2009a). Fast and accurate short read alignment with burrows-wheeler transform. Bioinformatics (Oxford, England), 25(14): 1754-1760.
14. Li et al. (2009b) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, doi:10.1093/bioinformatics/btp336.
15. Kurtz, S. and Schleiermacher, C. (1999). Reputer: fast computation of maximal repeats in complete genomes. Bioinformatics, 15(5): 426-427.
16. Manber, U. and Myers, G. (1990). Suffix arrays: A new method for on-line string searches. In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 319-327, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics.
17. McCreight, E. M. (1976). A Space-Economical Suffix Tree Construction Algorithm. J. ACM 23(2): 262-272.
18. National Center for Biotechnology Information. (2009). dbSNP Home Page. [Online] Available at: http://www.ncbi.nlm.nih.gov/projects/SNP/ [Accessed 10 February 2010].
19. Sadakane, K. (2003). New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2): 294-313.
20. Sherry, S. T., M. H. Ward, et al. (2001). dbSNP: the NCBI database of genetic variation. Nucleic Acids Res 29(1): 308-11.
21. Smith, T. F. and M. S. Waterman. (1981). Identification of common molecular subsequences. J Mol Biol 147(1): 195-7.