approximate string matching with compressed indexes近似串匹配与压缩索引.pdfVIP

Algorithms 2009, 2, 1105-1136; doi:10.3390/a2031105 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Approximate String Matching with Compressed Indexes ´ Luıs M. S. Russo , Gonzalo Navarro , Arlindo L. Oliveira , and Pedro Morales INESC-ID, R. Alves Redol 9, 1000 Lisboa, Portugal; E-Mail: aml@inesc-id.pt (A.L.O.) Department of Computer Science, University of Chile, Avenida Blanco Encalada, 2120, 837-0459 Santiago, Chile Santiago, Chile; E-Mails: gnavarro@dcc.uchile.cl (G.N.); pemorale@dcc.uchile.cl (P.M.) ´ ˆ CITI, Departamento de Informatica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal ´ ´ Instituto Superior Tecnico, Universidade Tecnica de Lisboa, 1049-001 Lisboa, Portugal Author to whom correspondence should be addressed; E-Mail: lsr@di.fct.unl.pt; Tel: +351 21 294 85 36 and Fax: +351 21 294 85 41. Received: 9 July 2009; in revised form: 8 September 2009 / Accepted: 9 September 2009 / Published: 10 September 2009 Abstract: A compressed full-text self-index for a text is a data structure requiring reduced space and able to search for patterns in . It can also reproduce any substring of , thus actually replacing . Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this pape