{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:45Z","timestamp":1725573345276},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352259"},{"type":"electronic","value":"9783540352266"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775300_34","type":"book-chapter","created":{"date-parts":[[2006,6,14]],"date-time":"2006-06-14T07:51:04Z","timestamp":1150271464000},"page":"397-409","source":"Crossref","is-referenced-by-count":0,"title":["A New Method for Finding Approximate Repetitions in DNA Sequences"],"prefix":"10.1007","author":[{"given":"Di","family":"Wang","sequence":"first","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qingquan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Baichen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"David, W.M.: Bioinformatics Sequence and Genome Analysis. Cold Spring Harbor Laborary Press (2001)"},{"issue":"15","key":"34_CR2","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"International Human Genome Sequencing Consortium","year":"2001","unstructured":"International Human Genome Sequencing Consortium. Initial sequencing and analysis of the human genome. Nature\u00a0409(15), 860\u2013921 (2001)","journal-title":"Nature"},{"issue":"1","key":"34_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00414-002-0317-8","volume":"117","author":"S. IBeleza","year":"2003","unstructured":"IBeleza, S., Alves, C., Gonzalez-Neira, A., Lareu, M., Amorim, A., Carracedo, A., Gusmao, L.: Extending STR markers in Y chromosome haplotypes. Int.J.Legal Med.\u00a0117(1), 27\u201333 (2003)","journal-title":"Int.J.Legal Med."},{"issue":"2","key":"34_CR4","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1520\/JFS14969J","volume":"46","author":"D.R. Young","year":"2001","unstructured":"Young, D.R., Tun, Z., Honda, K., Matoba, R.: Identifying sex chromosome abnormalities in forensic DNA testing using amelogenin and sex chromosome short tandem repeats. J.Forensic Sci.\u00a046(2), 346\u2013348 (2001)","journal-title":"J.Forensic Sci."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Moore, C.J., Daly, E.M., Tassone, F., et al.: The effect of pre-mutation of X chromosome CGG trinucleotide repeats on brain anatomy. Brain (October 2004)","DOI":"10.1093\/brain\/awh256"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/279069.279079","volume-title":"RECOMB 1998","author":"G. Benson","year":"1998","unstructured":"Benson, G.: An algorithm for finding tandem repeats of unspecified pattern size. In: RECOMB 1998, pp. 20\u201329. ACM Press, New York (1998)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: Proc. Of the 4th Annual Symposium on Combinatorial Pattern Matching, Italy, vol.\u00a0684, pp. 120\u2013133 (1993)","DOI":"10.1007\/BFb0029801"},{"issue":"22","key":"34_CR8","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"S. Kurtz","year":"2001","unstructured":"Kurtz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: REPuter: the manifold applications of repeat analysis on a genomic scale. Nucl. Acids Res.\u00a029(22), 4633\u20134642 (2001)","journal-title":"Nucl. Acids Res."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"4828","DOI":"10.1093\/nar\/22.22.4828","volume":"22","author":"G. Benson","year":"1994","unstructured":"Benson, G., Waterman, M.: A method for fast database search for all k-nucleotide repeats. Nucl. Acids Res.\u00a022, 4828\u20134836 (1994)","journal-title":"Nucl. Acids Res."},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1998","unstructured":"Benson, G.: Tandem repeats finder: a program t analyze dna. Nucl. Acids Res.\u00a027(2), 573\u2013580 (1998)","journal-title":"Nucl. Acids Res."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/974614.974644","volume-title":"RECOMB 2004","author":"Y. Wexler","year":"2004","unstructured":"Wexler, Y., Yakhini, Z., Kashi, Y., Geiger, D.: Finding approximate tandem repeats in genomic sequences. In: RECOMB 2004, pp. 223\u2013232. ACM Press, New York (2004)"},{"key":"34_CR12","volume-title":"Computer science and computational biology.","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on string, trees and sequences. In: Computer science and computational biology, Cambridge University Press, Cambridge (1997)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Kahveci, T., Singh, A.K.: An efficient index strction of string databases. In: VLDB 2001, pp. 351\u2013360 (2001)","DOI":"10.1016\/S0065-3527(01)57008-6"},{"key":"34_CR14","first-page":"281","volume-title":"BIBE 2005","author":"D. Wang","year":"2005","unstructured":"Wang, D., Wang, G., Wu, Q., Chen, B.: Finding LPRs in DNA sequence based on a new index SUA. In: BIBE 2005, pp. 281\u2013284. IEEE Computer Science, Los Alamitos (2005)"},{"issue":"12","key":"34_CR15","first-page":"207","volume":"33","author":"D. Wang","year":"2005","unstructured":"Wang, D., Wang, G., Chen, B., Wu, Q., Wang, B., Han, D.: A new lightweight index SUA for biological sequence anlysis. J. Huazhong Univ. of Sci. & Tech.\u00a033(12), 207\u2013210 (2005)","journal-title":"J. Huazhong Univ. of Sci. & Tech."},{"key":"34_CR16","unstructured":"Wang, D., Wang, G., Wu, Q., Chen, B.: Finding approximate repetitions in DNA sequence based on SUA. Technology Report (2005), http:\/\/mitt.neu.edu.cn"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775300_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:47Z","timestamp":1605643607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775300_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352259","9783540352266"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11775300_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}