{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:22Z","timestamp":1725893962785},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_27","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"242-254","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Study of Compressed Indexing and Local Alignments of DNA"],"prefix":"10.1007","author":[{"given":"Tak-Wah","family":"Lam","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]},{"given":"Siu-Lung","family":"Tam","sequence":"additional","affiliation":[]},{"given":"Chi-Kwong","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., Schaffer, T.L., Zhang, A.A., Miller, Z., Lipman, D.J.: Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Research\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Research"},{"key":"27_CR3","unstructured":"Burrow, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, California (1994)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"27_CR5","unstructured":"Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: SODA, pp. 269\u2013278 (2001)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: STOC, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"27_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Hon, W.K., Lam, T.W., Sadakane, K., Sung, W.K.: Constructing compressed suffix arrays with large alphabets. In: ISAAC, pp. 240\u2013249, 2003 (to appear in Algorithmica)","DOI":"10.1007\/978-3-540-24587-2_26"},{"key":"27_CR9","unstructured":"Hon, W.K., Lam, T.W., Sung, W.K., Tse, W.L., Wong, C.K., Yiu, S.M.: Practical aspects of compressed suffix arrays and FM-Index in searching DNA sequences. In: ALENEX\/ANALC, pp. 31\u201338 (2004)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s007780200064","volume":"11","author":"E. Hunt","year":"2002","unstructured":"Hunt, E., Atkinson, M.P., Irving, R.W.: Database indexing for large DNA and protein sequence collections. The VLDB Journal\u00a011, 256\u2013271 (2002)","journal-title":"The VLDB Journal"},{"issue":"13","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirement of suffix trees. Software - Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software - Practice and Experience"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M. Li","year":"2004","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatterHunter II: Highly sensitive and fast homology search. Journal of Bioinformatics and Computational Biology\u00a02(3), 417\u2013440 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1089\/cmb.2005.12.407","volume":"12","author":"R. Lippert","year":"2005","unstructured":"Lippert, R.: Space-efficient whole genome comparisons with Burrows-Wheeler transforms. Journal of Computational Biology\u00a012(4), 407\u2013415 (2005)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Meek, C., Patel, J.M., Kasetty, S.: OASIS: An online and accurate technique for local-alignment searches on biological sequences. In: VLDB, pp. 910\u2013921 (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K. Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms\u00a048(2), 294\u2013313 (2003)","journal-title":"Journal of Algorithms"},{"key":"27_CR17","unstructured":"The BLAST Web Site: http:\/\/130.14.29.110\/BLAST\/"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:42Z","timestamp":1619517102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}