<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0121-750X</journal-id>
<journal-title><![CDATA[Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[ing.]]></abbrev-journal-title>
<issn>0121-750X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Distrital Francisco José de Caldas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-750X2018000200190</article-id>
<article-id pub-id-type="doi">10.14483/23448393.13248</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Nuevos Algoritmos para Búsqueda de Orden &#948;&#978;]]></article-title>
<article-title xml:lang="en"><![CDATA[New Algorithms for &#948;&#978;-Order Preserving Matching]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Niquefa]]></surname>
<given-names><![CDATA[Rafael]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[Germán]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional de Colombia  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Institución Universitaria Politécnico Grancolombiano  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Pontificia Javeriana  ]]></institution>
<addr-line><![CDATA[Cali ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Nacional de Colombia  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2018</year>
</pub-date>
<volume>23</volume>
<numero>2</numero>
<fpage>190</fpage>
<lpage>202</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2018000200190&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-750X2018000200190&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-750X2018000200190&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto:  El emparejamiento de cadenas según el orden compara la estructura de las cadenas de texto. Sin embargo, sus áreas de aplicación requieren mayor flexibilidad en el criterio de comparación. Este artículo avanza en esta dirección al extender [27].  Método:  Se define la búsqueda de orden-&#948;&#978; como una variante aproximada del problema de emparejamiento de cadenas según orden. Se proponen dos soluciones basadas en árboles de segmentos y árboles Fenwick: segtree BA and bitBA.  Resultados:  La eficiencia de los algoritmos propuestos se muestra experimentalmente comparándolos con los algoritmos presentados en [26] (naiveA y updateBA). Además, se presentan aplicaciones.  Conclusiones:  A pesar de que la complejidad en tiempo de peor-caso de los algoritmos propuestos (a decir, O(nm log m)) es mayor que la complejidad de update BA (&#920;(nm)), su cota baja &#8486;(n log n) los hace más eficientes en práctica. También se muestran aplicaciones del enfoque propuesto en recuperación de música y análisis del mercado de acciones con ejemplos reales.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context:  Order-preserving matching regards comparing the relative order of symbols within different strings. However, its application areas require more flexibility in the matching paradigm. We advance in this direction in this paper that extends our previous work [27].  Method:  We define &#948;&#978;-order preserving matching as an approximate variant of order-preserving matching. We devise two solutions for it based on segment and Fenwick trees: segtreeBA and bitBA.  Results:  We experimentally show the efficiency of our algorithms compared to the ones presented in [26] (naiveA and updateBA). Also, we present applications of our approach in music retrieval and stock market analysis.  Conclusions:  Even though the worst-case time complexity of the proposed algorithms (namely, O(nm log m)) is higher than the &#920;(nm)-time complexity of updateBA, their &#8486;(n log n) lower bound makes them more efficient in practice. On the other hand, we show that our approach is useful to identify similarity in music melodies and stock price trends through real application examples.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[String searching]]></kwd>
<kwd lng="en"><![CDATA[experimental algorithm analysis]]></kwd>
<kwd lng="en"><![CDATA[strings similarity metric]]></kwd>
<kwd lng="en"><![CDATA[Language: English]]></kwd>
<kwd lng="es"><![CDATA[Análisis experimental de algoritmos]]></kwd>
<kwd lng="es"><![CDATA[búsqueda de texto]]></kwd>
<kwd lng="es"><![CDATA[métrica de similitud.]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="">
<collab>MIDI Association</collab>
<article-title xml:lang=""><![CDATA[Midi official webpage]]></article-title>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brass]]></surname>
<given-names><![CDATA[Peter]]></given-names>
</name>
</person-group>
<source><![CDATA[Advanced Data Structures]]></source>
<year>2008</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<collab>Emilios Cambouropoulos</collab>
<article-title xml:lang=""><![CDATA[Maxime Crochemore, Costas Iliopoulos, Laurent Mouchard, and Yoan Pinzon. Algorithms for computing approximate repetitions in musical sequences]]></article-title>
<source><![CDATA[International Journal of Computer Mathematics]]></source>
<year>2002</year>
<volume>79</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1135-48</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tamanna Chhabra]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kulekci]]></surname>
<given-names><![CDATA[O&#287;uzhan]]></given-names>
</name>
<name>
<surname><![CDATA[Tarhio]]></surname>
<given-names><![CDATA[Jorma]]></given-names>
</name>
<name>
<surname><![CDATA[Holub]]></surname>
<given-names><![CDATA[Jan]]></given-names>
</name>
<name>
<surname><![CDATA[&#381;dárek]]></surname>
<given-names><![CDATA[Jan]]></given-names>
</name>
</person-group>
<source><![CDATA[Alternative algorithms for order-preserving matching]]></source>
<year>2015</year>
<conf-name><![CDATA[ Proceedings of the Prague Stringology Conference 2015]]></conf-name>
<conf-loc> </conf-loc>
<page-range>36-46</page-range><publisher-loc><![CDATA[Czech Republic ]]></publisher-loc>
<publisher-name><![CDATA[Czech Technical University in Prague]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chhabra]]></surname>
<given-names><![CDATA[Tamanna]]></given-names>
</name>
<name>
<surname><![CDATA[Tarhio]]></surname>
<given-names><![CDATA[Jorma]]></given-names>
</name>
</person-group>
<source><![CDATA[Order-preserving matching with filtration]]></source>
<year>2014</year>
<volume>8504</volume>
<conf-name><![CDATA[ Proceedings of the 13th International Symposium on Experimental Algorithms]]></conf-name>
<conf-loc> </conf-loc>
<page-range>307-14</page-range><publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crawford]]></surname>
<given-names><![CDATA[Tim]]></given-names>
</name>
<name>
<surname><![CDATA[Costas]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iliopoulos, and Rajeev Raman. String-Matching Techniques for Musical Similarity and Melodic Recognition]]></article-title>
<source><![CDATA[Computing in Musicology]]></source>
<year>1998</year>
<numero>11</numero>
<issue>11</issue>
<page-range>71-100</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crochemore]]></surname>
<given-names><![CDATA[Maxime]]></given-names>
</name>
<name>
<surname><![CDATA[Costas S.]]></surname>
<given-names><![CDATA[Iliopoulos]]></given-names>
</name>
<name>
<surname><![CDATA[Kociumaka]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
<name>
<surname><![CDATA[Kubica]]></surname>
<given-names><![CDATA[Marcin]]></given-names>
</name>
<name>
<surname><![CDATA[Langiu]]></surname>
<given-names><![CDATA[Alessio]]></given-names>
</name>
<name>
<surname><![CDATA[Solon P.]]></surname>
<given-names><![CDATA[Pissis]]></given-names>
</name>
<name>
<surname><![CDATA[Radoszewski]]></surname>
<given-names><![CDATA[Jakub]]></given-names>
</name>
<name>
<surname><![CDATA[Rytter]]></surname>
<given-names><![CDATA[Wojciech]]></given-names>
</name>
<name>
<surname><![CDATA[Walen´]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
</person-group>
<source><![CDATA[Order-Preserving Incomplete Suffix Trees and Order Preserving Indexes]]></source>
<year>2013</year>
<page-range>84-95</page-range><publisher-loc><![CDATA[Springer International Publishing ]]></publisher-loc>
<publisher-name><![CDATA[Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crochemore]]></surname>
<given-names><![CDATA[Maxime]]></given-names>
</name>
<name>
<surname><![CDATA[Costas S.]]></surname>
<given-names><![CDATA[Iliopoulos]]></given-names>
</name>
<name>
<surname><![CDATA[Kociumaka]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
<name>
<surname><![CDATA[Kubica]]></surname>
<given-names><![CDATA[Marcin]]></given-names>
</name>
<name>
<surname><![CDATA[Langiu]]></surname>
<given-names><![CDATA[Alessio]]></given-names>
</name>
<name>
<surname><![CDATA[Solon]]></surname>
<given-names><![CDATA[P. Pissis]]></given-names>
</name>
<name>
<surname><![CDATA[Radoszewski]]></surname>
<given-names><![CDATA[Jakub]]></given-names>
</name>
<name>
<surname><![CDATA[Rytter]]></surname>
<given-names><![CDATA[Wojciech]]></given-names>
</name>
<name>
<surname><![CDATA[Walen]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
</person-group>
<source><![CDATA[Order-preserving suffix trees and their algorithmic applications]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crochemore]]></surname>
<given-names><![CDATA[Maxime]]></given-names>
</name>
<name>
<surname><![CDATA[Costas S.]]></surname>
<given-names><![CDATA[Iliopoulos]]></given-names>
</name>
<name>
<surname><![CDATA[Kociumaka]]></surname>
<given-names><![CDATA[Tomas z.]]></given-names>
</name>
<name>
<surname><![CDATA[Kubica]]></surname>
<given-names><![CDATA[Marcin]]></given-names>
</name>
<name>
<surname><![CDATA[Langiu]]></surname>
<given-names><![CDATA[Alessio]]></given-names>
</name>
<name>
<surname><![CDATA[Solon P.]]></surname>
<given-names><![CDATA[Pissis]]></given-names>
</name>
<name>
<surname><![CDATA[Radoszewski]]></surname>
<given-names><![CDATA[Jakub]]></given-names>
</name>
<name>
<surname><![CDATA[Rytter]]></surname>
<given-names><![CDATA[Wojciech]]></given-names>
</name>
<name>
<surname><![CDATA[Walen´]]></surname>
<given-names><![CDATA[Tomas z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order-preserving indexing]]></article-title>
<source><![CDATA[Theor. Comput. Sci.]]></source>
<year>2016</year>
<volume>638</volume>
<numero>C</numero>
<issue>C</issue>
<page-range>122-35</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de Berg]]></surname>
<given-names><![CDATA[Mark]]></given-names>
</name>
<name>
<surname><![CDATA[Cheong]]></surname>
<given-names><![CDATA[Otfried]]></given-names>
</name>
<name>
<surname><![CDATA[van Kreveld]]></surname>
<given-names><![CDATA[Marc]]></given-names>
</name>
<name>
<surname><![CDATA[Overmars]]></surname>
<given-names><![CDATA[Mark]]></given-names>
</name>
</person-group>
<source><![CDATA[More geometric data structures: Windowing. Computational Geometry: Algorithms and Applications]]></source>
<year>2008</year>
<page-range>219-41</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Faro]]></surname>
<given-names><![CDATA[Simone]]></given-names>
</name>
<name>
<surname><![CDATA[M. Oguzhan]]></surname>
<given-names><![CDATA[Ku¨lekci]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient algorithms for the order preserving pattern matching problem]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fenwick]]></surname>
<given-names><![CDATA[Peter M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new data structure for cumulative frequency tables]]></article-title>
<source><![CDATA[Software: Practice and Experience]]></source>
<year>1994</year>
<volume>24</volume>
<page-range>327-36</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gawrychowski]]></surname>
<given-names><![CDATA[Pawe&#322;]]></given-names>
</name>
<name>
<surname><![CDATA[ski]]></surname>
<given-names><![CDATA[Przemys&#322;aw Uznan´]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order-preserving pattern matching with k mismatches]]></article-title>
<source><![CDATA[Theoretical Computer Science]]></source>
<year>2016</year>
<numero>638</numero>
<issue>638</issue>
<page-range>136-44</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hasan]]></surname>
<given-names><![CDATA[Md Mahbubul]]></given-names>
</name>
<name>
<surname><![CDATA[Islam]]></surname>
<given-names><![CDATA[ASM Shohidull]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammad Saifur]]></surname>
<given-names><![CDATA[Rahman]]></given-names>
</name>
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[M Sohel]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order preserving pattern matching revisited]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>2015</year>
<numero>55</numero>
<issue>55</issue>
<page-range>15-21</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hasan]]></surname>
<given-names><![CDATA[Md Mahbubul]]></given-names>
</name>
<name>
<surname><![CDATA[Islam]]></surname>
<given-names><![CDATA[ASM Sohidull]]></given-names>
</name>
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[Mohammad Saifur]]></given-names>
</name>
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[M Sohel]]></given-names>
</name>
</person-group>
<source><![CDATA[Order preserving prefix tables]]></source>
<year>2014</year>
<conf-name><![CDATA[ International Symposium on String Processing and Information Retrieval]]></conf-name>
<conf-loc> </conf-loc>
<page-range>111-6</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="">
<collab>Inc IMDb</collab>
<source><![CDATA[John Williams imdb profile]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="">
<collab>Inc IMDb</collab>
<source><![CDATA[Star Wars: Episode V The Empire Strikes Back]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[Jinil]]></given-names>
</name>
<name>
<surname><![CDATA[Eades]]></surname>
<given-names><![CDATA[Peter]]></given-names>
</name>
<name>
<surname><![CDATA[Fleischer]]></surname>
<given-names><![CDATA[Rudolf]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[Seok-Hee]]></given-names>
</name>
<name>
<surname><![CDATA[Iliopoulos]]></surname>
<given-names><![CDATA[Costas S.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[Kunsoo]]></given-names>
</name>
<name>
<surname><![CDATA[Simon J.]]></surname>
<given-names><![CDATA[Puglisi]]></given-names>
</name>
<name>
<surname><![CDATA[Tokuyama]]></surname>
<given-names><![CDATA[Takeshi]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order-preserving matching]]></article-title>
<source><![CDATA[Theoretical Computer Science,]]></source>
<year>2014</year>
<numero>525</numero>
<issue>525</issue>
<page-range>68-79</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kubica]]></surname>
<given-names><![CDATA[Marcin]]></given-names>
</name>
<name>
<surname><![CDATA[Kulczyn´ski]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
<name>
<surname><![CDATA[Radoszewski]]></surname>
<given-names><![CDATA[Jakub]]></given-names>
</name>
<name>
<surname><![CDATA[Rytter]]></surname>
<given-names><![CDATA[Wojciech]]></given-names>
</name>
<name>
<surname><![CDATA[Walen´]]></surname>
<given-names><![CDATA[Tomasz]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A linear time algorithm for consecutive permutation pattern matching]]></article-title>
<source><![CDATA[Information Processing Letters]]></source>
<year>2013</year>
<volume>113</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>430-3</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[Inbok]]></given-names>
</name>
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan J.]]></given-names>
</name>
</person-group>
<source><![CDATA[&#948;&#947; - Parameterized Matching]]></source>
<year>2009</year>
<page-range>236-48</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
</person-group>
<source><![CDATA[Definition and solution of a new string searching variant termed &#948;&#947;-parameterized matching]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Bogota, Colombia ]]></publisher-loc>
<publisher-name><![CDATA[National University of Colombia]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[Inbok]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan J]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximate Function Matching under &#948; and &#947; Distances]]></source>
<year>2012</year>
<page-range>348-59</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Pino]]></surname>
<given-names><![CDATA[Camilo]]></given-names>
</name>
<name>
<surname><![CDATA[Niño]]></surname>
<given-names><![CDATA[Luis F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximate Abelian Periods to Find Motifs in Biological Sequences]]></source>
<year>2015</year>
<page-range>121-30</page-range><publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan]]></given-names>
</name>
</person-group>
<source><![CDATA[A novel approach to approximate parikh matching for comparing composition in biological sequences]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the 6th International Conference on Bioinformatics and Computational Biology (BICoB 2014)]]></conf-name>
<conf-date>2014</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niquefa]]></surname>
<given-names><![CDATA[Rafael]]></given-names>
</name>
</person-group>
<source><![CDATA[Definition and solution of a new approximate variant of the order preserving matching problem]]></source>
<year>2017</year>
<publisher-name><![CDATA[Universidad Nacional de Colombia]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niquefa]]></surname>
<given-names><![CDATA[Rafael]]></given-names>
</name>
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[Germán]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan]]></given-names>
</name>
</person-group>
<source><![CDATA[Order Preserving Matching under &#948;&#947;-approximation]]></source>
<year>2017</year>
<conf-name><![CDATA[ Congreso Internacional de Ciencias Básicas e Ingeniería]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niquefa]]></surname>
<given-names><![CDATA[Rafael]]></given-names>
</name>
<name>
<surname><![CDATA[Mendivelso]]></surname>
<given-names><![CDATA[Juan]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[Germán]]></given-names>
</name>
<name>
<surname><![CDATA[Pinzón]]></surname>
<given-names><![CDATA[Yoan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Segment and fenwick trees for approximate order preserving matching]]></article-title>
<source><![CDATA[Workshop on Engineering Applications]]></source>
<year>2017</year>
<page-range>131-43</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="">
<collab>Thomas Scarff</collab>
<source><![CDATA[MIDI note numbers]]></source>
<year></year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
