{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:37Z","timestamp":1725487657370},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_40","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"465-474","source":"Crossref","is-referenced-by-count":1,"title":["Indexing Factors with Gaps"],"prefix":"10.1007","author":[{"given":"M. Sohel","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range Searching in Categorical Data: Colored Range Searching on Grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"40_CR2","unstructured":"Allali, J., Sagot, M.-F.: The at Most k-Deep Factor Tree. Technical Report 2004-03 (2004)"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New Data Structures for Orthogonal Range Searching. In: FOCS, pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1186\/1471-2105-4-66","volume":"4","author":"M. Brudno","year":"2003","unstructured":"Brudno, M., Chapman, M., G\u00f6ttgens, B., Batzoglou, S., Morgenstern, B.: Fast and Sensitive Multiple Alignment of Large Genomic Sequences. BMC Bioinformatics\u00a04, 66 (2003)","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"40_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1101\/gr.926603","volume":"13","author":"M. Brudno","year":"2003","unstructured":"Brudno, M., Do, C.B., Cooper, G.M., Kim, M.F., Davydov, E., Green, E.D., Sidow, A., Batzoglou, S.: Lagan and Multi-Lagan: Efficient Tools for Large-Scale Multiple Alignment of Genomic Dna. Genome Research\u00a013(4), 721\u2013731 (2003)","journal-title":"Genome Research"},{"key":"40_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"issue":"5","key":"40_CR7","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1093\/nar\/gkh340","volume":"32","author":"R.C. Edgar","year":"2004","unstructured":"Edgar, R.C.: Muscle: Multiple Sequence Alignment with High Accuracy and High Throughput. Nucleic Acids Research\u00a032(5), 1792\u20131797 (2004)","journal-title":"Nucleic Acids Research"},{"key":"40_CR8","first-page":"491","volume-title":"VLDB","author":"L. Gravano","year":"2001","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate String Joins in a Database (almost) for Free. In: Apers, P.M.G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., Snodgrass, R.T. (eds.) VLDB, pp. 491\u2013500. Morgan Kaufmann, San Francisco (2001)"},{"key":"40_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences \u2013 Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences \u2013 Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"H\u00f6hl, M., Kurtz, S., Ohlebusch, E.: Efficient Multiple Genome Alignment. In: ISMB, pp. 312\u2013320 (2002)","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312"},{"issue":"6","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1142\/S0129054105003716","volume":"16","author":"C.S. Iliopoulos","year":"2005","unstructured":"Iliopoulos, C.S., McHugh, J.A.M., Peterlongo, P.: A First Approach to Finding Common Motifs with Gaps. J. Found. Comput. Sci.\u00a016(6), 1145\u20131154 (2005)","journal-title":"J. Found. Comput. Sci."},{"key":"40_CR12","first-page":"164","volume":"14","author":"M. Li","year":"2003","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: Patternhunter ii: Highly Sensitive and Fast Homology Search. Genome Informatics\u00a014, 164\u2013175 (2003)","journal-title":"Genome Informatics"},{"issue":"3","key":"40_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B. Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: Patternhunter: Faster and More Sensitive Homology Search. Bioinformatics\u00a018(3), 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"issue":"2","key":"40_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"},{"issue":"9","key":"40_CR15","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1093\/bioinformatics\/bti224","volume":"21","author":"M. Michael","year":"2005","unstructured":"Michael, M., Dieterich, C., Vingron, M.: Siteblast-Rapid and Sensitive Local Alignment of Genomic Sequences Employing Motif Anchors. Bioinformatics\u00a021(9), 2093\u20132094 (2005)","journal-title":"Bioinformatics"},{"key":"40_CR16","unstructured":"Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In: SODA, pp. 657\u2013666 (2002)"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing Text with Approximate q-Grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 350\u2013363. Springer, Heidelberg (2000)"},{"key":"40_CR18","unstructured":"Peterlongo, P., Allali, J., Sagot, M.-F.: The Gapped-Factor Tree. In: The Prague Stringology Conference, to appear (2006)"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-60313-1_153","volume-title":"Algorithms - ESA \u201995","author":"E. Sutinen","year":"1995","unstructured":"Sutinen, E., Tarhio, J.: On Using q-Gram Locations in Approximate String Matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 327\u2013340. Springer, Heidelberg (1995)"},{"issue":"3","key":"40_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:01:30Z","timestamp":1556668890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}