Skip to main navigation Skip to search Skip to main content

Segment and fenwick trees for approximate order preserving matching

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationApplied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings
EditorsJuan Carlos Figueroa-Garcia, Eduyn Ramiro Lopez-Santana, Roberto Ferro-Escobar, Jose Luis Villa-Ramirez
PublisherSpringer Verlag
Pages131-143
Number of pages13
ISBN (Print)9783319669625
DOIs
StatePublished - 2017
Event4th Workshop on Engineering Applications, WEA 2017 - Cartagena, Colombia
Duration: 27 Sep 201729 Sep 2017

Publication series

NameCommunications in Computer and Information Science
Volume742
ISSN (Print)1865-0929

Conference

Conference4th Workshop on Engineering Applications, WEA 2017
Country/TerritoryColombia
CityCartagena
Period27/09/1729/09/17

Keywords

  • Binary indexed tree
  • Fenwick tree
  • Segment tree
  • String searching
  • Strings similarity metric

Fingerprint

Dive into the research topics of 'Segment and fenwick trees for approximate order preserving matching'. Together they form a unique fingerprint.

Cite this