Compressed indexing and local alignment of DNA
暂无分享,去创建一个
Siu-Ming Yiu | Tak Wah Lam | Siu-Lung Tam | Wing-Kin Sung | Chi-Kwong Wong | W. Sung | T. Lam | S. Yiu | C. Wong | Siu-Lung Tam
[1] James Ze Wang,et al. SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size , 2002, Bioinform..
[2] Wing-Kai Hon,et al. Constructing Compressed Suffix Arrays with Large Alphabets , 2003, ISAAC.
[3] Jignesh M. Patel,et al. OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences , 2003, VLDB.
[4] Anthony K. H. Tung,et al. Indexing DNA Sequences Using q-Grams , 2005, DASFAA.
[5] Giovanni Manzini,et al. Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[6] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999, Softw. Pract. Exp..
[7] Bin Ma,et al. PatternHunter II: highly sensitive and fast homology search. , 2003, Genome informatics. International Conference on Genome Informatics.
[8] S. Karlin,et al. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. , 1990, Proceedings of the National Academy of Sciences of the United States of America.
[9] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.
[10] Giovanni Manzini,et al. An experimental study of an opportunistic index , 2001, SODA '01.
[11] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[12] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[13] Ross Lippert,et al. Space-Efficient Whole Genome Comparisons with BurrowsWheeler Transforms , 2005, J. Comput. Biol..
[14] Malcolm P. Atkinson,et al. Database indexing for large DNA and protein sequence collections , 2002, The VLDB Journal.
[15] Martin Vingron,et al. q-gram based database searching using a suffix array (QUASAR) , 1999, RECOMB.
[16] Hugh E. Williams,et al. Indexing and Retrieval for Genomic Databases , 2002, IEEE Trans. Knowl. Data Eng..
[17] Ozgur Ozturk,et al. Effective indexing and filtering for similarity search in large biosequence databases , 2003, Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings..
[18] Siu-Ming Yiu,et al. Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences , 2004, ALENEX/ANALC.
[19] J. Schwartz,et al. Annotating large genomes with exact word matches. , 2003, Genome research.
[20] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[21] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[22] Stefan Kurtz,et al. Reducing the space requirement of suffix trees , 1999 .
[23] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.
[24] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .
[25] N. Stanietsky,et al. The interaction of TIGIT with PVR and PVRL2 inhibits human NK cell cytotoxicity , 2009, Proceedings of the National Academy of Sciences.
[26] Kunihiko Sadakane,et al. New text indexing functionalities of the compressed suffix arrays , 2003, J. Algorithms.
[27] Siu-Ming Yiu,et al. A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays , 2002, Algorithmica.