Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Segment and fenwick trees for approximate order preserving matching

  • Rafael Niquefa
  • , Juan Mendivelso
  • , Germán Hernández
  • , Yoan Pinzón

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

In this paper we combine two string searching related problems: the approximate string matching under parameters δ and γ, and the order preserving matching problem. Order-preserving matching regards the internal structure of the strings rather than their absolute values while matching under δ and γ distances permit a level of error. We formally define the δγ –order-preserving matching problem. We designed two algorithms for it based on the segment tree and the Fenwick tree, respectively. Also, we design and implement in C++ and an experimental setup to compare these algorithms with the naive solution and the updateBA algorithm introduced in [22]. The data structure based algorithms show better experimental performance due to their better lower bound of Ω (n lg n) complexity.

Idioma originalInglés
Título de la publicación alojadaApplied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings
EditoresJuan Carlos Figueroa-Garcia, Eduyn Ramiro Lopez-Santana, Roberto Ferro-Escobar, Jose Luis Villa-Ramirez
EditorialSpringer Verlag
Páginas131-143
Número de páginas13
ISBN (versión impresa)9783319669625
DOI
EstadoPublicada - 2017
Evento4th Workshop on Engineering Applications, WEA 2017 - Cartagena, Colombia
Duración: 27 sep. 201729 sep. 2017

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen742
ISSN (versión impresa)1865-0929

Conferencia

Conferencia4th Workshop on Engineering Applications, WEA 2017
País/TerritorioColombia
CiudadCartagena
Período27/09/1729/09/17

Huella

Profundice en los temas de investigación de 'Segment and fenwick trees for approximate order preserving matching'. En conjunto forman una huella única.

Citar esto