{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:27:45Z","timestamp":1725517665758},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705987"},{"type":"electronic","value":"9783540706007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70600-7_33","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T15:14:34Z","timestamp":1220022874000},"page":"436-445","source":"Crossref","is-referenced-by-count":1,"title":["Indexing Factors in DNA\/RNA Sequences"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Flouri","sequence":"first","affiliation":[]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Ladislav","family":"Vagner","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Vor\u00e1\u010dek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","first-page":"225","volume-title":"String Algorithmics","author":"M. Vor\u00e1\u010dek","year":"2004","unstructured":"Vor\u00e1\u010dek, M., Melichar, B., Christodoulakis, M.: Generalized and weighted strings: Repetitions and pattern matching. In: String Algorithmics, pp. 225\u2013248. KCL Publications, King\u2019s College London (2004)"},{"volume-title":"Proceedings of International Conference on Numerical Analysis and Applied Mathematics","year":"2005","author":"M. Vor\u00e1\u010dek","unstructured":"Vor\u00e1\u010dek, M., Melichar, B.: Searching for regularities in generalized strings using finite automata. In: Proceedings of International Conference on Numerical Analysis and Applied Mathematics. Wiley-VCH, Weinheim (2005)","key":"33_CR2"},{"volume-title":"Proceedings of International Conference on Computational Methods in Science and Engineering","year":"2007","author":"M. Vor\u00e1\u010dek","unstructured":"Vor\u00e1\u010dek, M., Vagner, V., Flouri, T.: Indexing Degenerate Strings. In: Proceedings of International Conference on Computational Methods in Science and Engineering, American Institute of Physics, Melville, New York (2007)","key":"33_CR3"},{"unstructured":"Flouri, T.: Indexing Degenerate Strings, Master Thesis, Czech Technical University, Prague (2008)","key":"33_CR4"},{"volume-title":"Introduction to automata, languages and computation","year":"1979","author":"J.E. Hopcroft","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata, languages and computation. Addison-Wesley, Reading (1979)","key":"33_CR5"},{"key":"33_CR6","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)"},{"doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., McHugh, J., Peterlongo, P., Pisanti, N., Rytter, W., Sagot, M.: A First Approach to Finding Common Motifs with Gaps. International Journal of Foundations of Computer Science (2004)","key":"33_CR7","DOI":"10.1142\/S0129054105003716"},{"issue":"3","key":"33_CR8","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"},{"doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., Sohel Rahman, M.: Indexing factors with gaps. Algorithmica (to appear) (DOI: 10.1007\/s00453-007-9141-3)","key":"33_CR9","DOI":"10.1007\/s00453-007-9141-3"},{"key":"33_CR10","first-page":"182","volume-title":"Stringology","author":"P. Peterlongo","year":"2006","unstructured":"Peterlongo, P., Allali, J., Sagot, M.-F.: The gapped-factor tree. In: Holub, J., Zdrek, J. (eds.) Stringology, pp. 182\u2013196. Czech Technical University, Prague (2006)"}],"container-title":["Communications in Computer and Information Science","Bioinformatics Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70600-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:38Z","timestamp":1605762518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70600-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705987","9783540706007"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70600-7_33","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[]}}