{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:53:21Z","timestamp":1725544401323},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540321743"},{"type":"electronic","value":"9783540321750"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11670834_19","type":"book-chapter","created":{"date-parts":[[2006,2,13]],"date-time":"2006-02-13T10:16:10Z","timestamp":1139825770000},"page":"236-250","source":"Crossref","is-referenced-by-count":1,"title":["Information Retrieval of Sequential Data in Heterogeneous XML Databases"],"prefix":"10.1007","author":[{"given":"Eugen","family":"Popovici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Fran\u00e7ois","family":"Marteau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gildas","family":"M\u00e9nier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"MidiXML, Standard MIDI File DTD: MIDI XML, Version 1.0 January 13 (2004), http:\/\/www.recordare.com\/dtds\/midixml.html"},{"key":"19_CR2","unstructured":"MusicXML, MusicXML Definition, Version 1.0 (January 2004), http:\/\/www.recordare.com\/xml.html"},{"key":"19_CR3","unstructured":"Robinson, A.: XML\u2019s and DTD\u2019s for Biology. In: An XML Workshop for Biologists and Bioinformaticians (2000), http:\/\/industry.ebi.ac.uk\/~alan\/XMLWorkshop\/"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/984321.984326","volume":"22","author":"N. Fuhr","year":"2004","unstructured":"Fuhr, N., Gro\u03b2johann, K.: XIRQL: An XML query language based on information retrieval concepts. ACM Transactions on Information Systems (TOIS)\u00a022(2), 313\u2013356 (2004)","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Koudas, N., Srivastava, D.: Approximate Matching in XML. In: Advanced Technology Seminar 5, ICDE 2003 (2003)","DOI":"10.1109\/ICDE.2003.1260876"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Lakshmanan, L.V.S., Pandi, S.: FleXPath: Flexible Structure and Full-Text Querying for XML. In: SIGMOD Conference, Paris France, June 2004, pp. 83\u201394 (2004)","DOI":"10.1145\/1007568.1007581"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Carmel, D., Maarek, Y.S., Mandelbrod, M., Mass, Y., Soffer, A.: Searching XML documents via XML fragments. In: SIGIR 2003, Toronto, Canada, pp. 151\u2013158 (2003)","DOI":"10.1145\/860435.860464"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Dorneles, C.F., Heuser, C.A., Lima, A.E.N., Da Silva, A., De Moura, E.: Measuring similarity between collection of values. In: 6th ACM International Workshop on Web Information and Data Management, WIDM (2004)","DOI":"10.1145\/1031453.1031465"},{"key":"19_CR9","unstructured":"Clark, J., DeRose, S.: XML Path Language (XPath) Version 1.0, W3C Recommendation, November 16 (1999), http:\/\/www.w3.org\/TR\/xpath.html"},{"key":"19_CR10","unstructured":"Biron, P., Malhotra, A.: XML Schema Part 2: Datatypes Second Edition, W3C Recommendation, October 28 (2004) http:\/\/www.w3.org\/TR\/xmlschema-2\/"},{"issue":"4\/5","key":"19_CR11","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized Binary Search Trees. ALGORITHMICA\u00a016(4\/5), 464\u2013497 (1996)","journal-title":"ALGORITHMICA"},{"key":"19_CR12","volume-title":"The 9th International Conference on Information Processing and Magement of Uncertainty in Knowledge-Based Systems","author":"G. M\u00e9nier","year":"2002","unstructured":"M\u00e9nier, G., Marteau, P.F.: Information retrieval in heterogeneous XML knowledge bases. In: The 9th International Conference on Information Processing and Magement of Uncertainty in Knowledge-Based Systems, Annecy, France, July 1-5, 2002, IEEE, Los Alamitos (2002)"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G.A. Navarro","year":"2001","unstructured":"Navarro, G.A.: Guided Tour to Approximate String Matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"19_CR14","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: Proc. 2003 Int. Conf. Very Large Data Bases (VLDB 2003), Berlin, Germany, September 2003, pp. 910\u2013921 (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"issue":"3","key":"19_CR15","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(3), 256\u2013271 (2002)","journal-title":"The VLDB Journal"},{"key":"19_CR16","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. Journal of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"19_CR17","doi-asserted-by":"publisher","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":"19_CR18","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, 249\u2013260 (1995)","journal-title":"ALGORITHMICA"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"Tai, K.C.: The tree to tree correction problem. J. ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Wang, T.L.J., Shapiro, B., Shasha, D., Zhang, K., Currey, K.M.: An algorithm for finding the largest approximately common substructures of two trees. J. IEEE Pattern Analysis and Machine Intelligence\u00a0 20(8) (August 1998)","DOI":"10.1109\/34.709622"},{"key":"19_CR21","first-page":"707","volume":"10","author":"A. Levenshtein","year":"1966","unstructured":"Levenshtein, A.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Sov. Phy. Dohl.\u00a010, 707\u2013710 (1966)","journal-title":"Sov. Phy. Dohl."},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"12","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fisher, M.: The String-to-String Correction Problem. Journal of the Association for Computing Machinery\u00a012(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"19_CR23","unstructured":"Mignet, L., Barbosa, D., Veltri, P.: The Web XML: A First Study (2003), http:\/\/citeseer.ist.psu.edu\/mignet03web.html"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Shasha, D.: Warping indexes with envelope transforms for query by humming. In: Proceedings of the 2003 ACM SIGMOD, San Diego, California, pp. 181\u2013192 (2003)","DOI":"10.1145\/872757.872780"},{"issue":"7","key":"19_CR25","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/S0306-4379(02)00102-3","volume":"28","author":"S. Park","year":"2003","unstructured":"Park, S., Chu, W., Yoon, J., Won, J.: Similarity search of time-warped subsequences via a suffix tree. Information Systems\u00a028(7), 867\u2013883 (2003)","journal-title":"Information Systems"},{"key":"19_CR26","unstructured":"Yi, B., Jagadish, H.V., Faloutsos, C.: Efficient Retrieval of Similar Time Sequences Under Time Warping. In: ICDE, pp. 201\u2013208 (1998)"},{"key":"19_CR27","unstructured":"van Zwol, R., Kazai, G., Lalmas, M.: Multimedia track, INEX (April-December 2005), http:\/\/inex.is.informatik.uni-duisburg.de\/2005\/tracks\/media\/index.html"}],"container-title":["Lecture Notes in Computer Science","Adaptive Multimedia Retrieval: User, Context, and Feedback"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11670834_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T17:57:25Z","timestamp":1555437445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11670834_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540321743","9783540321750"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11670834_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}