{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:42:15Z","timestamp":1767008535595,"version":"3.38.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2011]]},"DOI":"10.1587\/transinf.e94.d.1369","type":"journal-article","created":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T06:19:37Z","timestamp":1309501177000},"page":"1369-1377","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Divide-and-Conquer Algorithm for Indexing Human Genome Sequences"],"prefix":"10.1587","volume":"E94-D","author":[{"given":"Woong-Kee","family":"LOH","sequence":"first","affiliation":[{"name":"Department of Multimedia, Sungkyul University"}]},{"given":"Yang-Sae","family":"MOON","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Kangwon National University"}]},{"given":"Wookey","family":"LEE","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Inha University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/25.17.3389"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Atkinson and M. Jordan, “Providing orthogonal persistence for Java,” Proc. European Conf. on Object-Oriented Programming (ECOOP), pp.383-395, Brussels, Belgium, July 1998.","DOI":"10.1007\/BFb0054100"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Barsky, U. Stege, A. Thomo, and C. Upton, “A new method for indexing genomes using on-disk suffix trees,” Proc. ACM Conference on Information and Knowledge Management (CIKM), pp.649-658, Napa Valley, California, Oct. 2008.","DOI":"10.1145\/1458082.1458170"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S.J. Bedathur and J.R. Haritsa, “Engineering a fast online persistent suffix tree construction,” Proc. Int'l Conf. on Data Engineering (ICDE), IEEE, pp.720-731, Boston, Massachusetts, March 2004.","DOI":"10.1109\/ICDE.2004.1320040"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C.-F. Cheung, J. Yu, and H. Lu, “Constructing suffix tree for gigabyte sequences with megabyte memory,” IEEE Trans. Knowl. Data Eng., vol.17, no.1, pp.90-105, Jan. 2005.","DOI":"10.1109\/TKDE.2005.3"},{"key":"6","first-page":"390","volume":"41st","author":"FERRAGINA P","year":"2000","ISSN":"https:\/\/linproxy.fan.workers.dev:443\/https\/id.crossref.org\/issn\/0272-5428","issn-type":"print"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Ghoting and K. Makarychev, “Serial and parallel methods for i\/o efficient suffix tree construction,” Proc. Int'l Conf. Management of Data, ACM SIGMOD, pp.827-840, Providence, Rhode Island, June 2009.","DOI":"10.1145\/1559845.1559931"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/spe.535"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] W.-K. Hon, R. Shah, S.V. Thankachan, and J.S. Vitter, “On entropy-compressed text indexing in external memory,” Proc. String Processing and Information Retrieval Symposium (SPIRE), pp.75-89, Saariselka, Finland, Aug. 2009.","DOI":"10.1007\/978-3-642-03784-9_8"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] E. Hunt, M.P. Atkinson, and R.W. Irving, “Database indexing for large DNA and protein sequence collections,” VLDB Journal, vol.11, no.3, pp.256-271, 2002.","DOI":"10.1007\/s007780200064"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.5.426"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] B. Langmead, C. Trapnell, M. Pop, and S.L. Salzberg, “Ultrafast and memory-efficient alignment of short DNA sequences to the human genome,” Genome Biology, vol.10, no.3, pp.R25.1-R25.10, March 2009.","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"15","unstructured":"[15] H. Li and R. Durbin, “Fast and accurate short read alignment with Burrows-Wheeler transform,” Bioinformatics, vol.25, no.14, pp.1754-1760, July 2009."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] H. Li and R. Durbin, “Fast and accurate long-read alignment with Burrows-Wheeler transform,” Bioinformatics, vol.26, no.5, pp.589-595, March 2010.","DOI":"10.1093\/bioinformatics\/btp698"},{"key":"17","unstructured":"[17] R. Li, C. Yu, Y. Li, T.-W. Lam, S.-M. Yiu, K. Kristiansen, and J. Wang, “SOAP2: An improved ultrafast tool for short read alignment,” Bioinformatics, vol.25, no.15, pp.1966-1967, Aug. 2009."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] B. Phoophakdee and M.J. Zaki, “Genome-scale disk-based suffix tree indexing,” Proc. Int'l Conf. on Management of Data, pp.833-844, ACM SIGMOD, Beijing, China, June 2007.","DOI":"10.1145\/1247480.1247572"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Phoophakdee and M.J. Zaki, “TRELLIS+: An effective approach for indexing genome-scale sequences using suffix trees,” Proc. Pacific Symp. on Biocomputing, pp.90-101, Kohala Coast, Hawaii, Jan. 2008.","DOI":"10.1142\/9789812776136_0011"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] E. Rocke, “Using Suffix trees for gapped motif discovery,” Proc. Annual Symp. on Combinatorial Pattern Matching (CPM), pp.335-349, Montreal, Canada, June 2000.","DOI":"10.1007\/3-540-45123-4_28"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] R. Sinha, S. Puglisi, A. Moffat, and A. Turpin, “Improving suffix array locality for fast pattern matching on disk,” Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp.661-672, Vancouver, Canada, June 2008.","DOI":"10.1145\/1376616.1376683"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Y. Tian, S. Tata, R.A. Hankins, and J.M. Patel, “Practical methods for constructing suffix trees,” VLDB Journal, vol.14, no.3, pp.281-299, 2005.","DOI":"10.1007\/s00778-005-0154-8"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] J.-I. Won, S.-K. Hong, J.-H. Yoon, S. Park, and S.-W. Kim, “A practical method for approximate subsequence search in DNA databases,” Proc. Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining (PAKDD), pp.921-931, Nanjing, China, May 2007.","DOI":"10.1007\/978-3-540-71701-0_103"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.jstage.jst.go.jp\/article\/transinf\/E94.D\/7\/E94.D_7_1369\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T21:15:32Z","timestamp":1741295732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.jstage.jst.go.jp\/article\/transinf\/E94.D\/7\/E94.D_7_1369\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1587\/transinf.e94.d.1369","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2011]]}}}