Juan Mendivelso

Juan Mendivelso
National University of Colombia | UNAL · Departamento de Matemáticas (Bogotá)

PhD, MSc in Computer Science, Computer Engineer

About

12
Publications
523
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
45
Citations
Introduction
Skills and Expertise

Publications

Publications (12)
Article
Parameterized pattern matching is a string searching variant that was initially defined to detect duplicate code but later proved to support several other applications. In particular, two equal-length strings X andY are a parameterized-match if there exists a bijective function g for which every text symbol in X is equal to g(Y). Baker was the firs...
Article
Full-text available
Context: Order-preserving matching regards the relative order of 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 γ -order preserving matching as an approximate variant of order-preserving matching. We devise...
Conference Paper
In this paper we combine two string searching related problems: the approximate string matching under parameters \(\delta \) and \(\gamma \), and the order preserving matching problem. Order-preserving matching regards the internal structure of the strings rather than their absolute values while matching under \(\delta \) and \(\gamma \) distances...
Article
Full-text available
Un problema importante en el análisis de mercado de valores y la recuperación de información musical es el emparejamiento con preservación de orden. Este problema es una variante recientemente introducida del problema de emparejamiento de cadenas en el que busca subcadenas en el texto cuya representación natural coincide con la representación natur...
Article
Computing a similarity measure of a given set of molecular sequences is an important task in bioinformatics studies. Weighted sequences have become an interesting research area since they allow a newer and more precise encoding paradigm of molecular structures. The longest common subsequence (LCS) has been an extensively studied technique to comput...
Conference Paper
A problem that has been gaining importance in recent years is that of computing the Abelian periods in a string. A string w has an Abelian period p if it is a sequence of permutations of a length–p string. In this paper, we define an approximate variant of Abelian periods which allows variations between adjacent elements of the sequence. Particular...
Conference Paper
Attributed graphs are widely used in many application domains, for example to model social networks. An attributed graph is a graph in which vertices and edges may have types and other attributes. Different query models have been developed to obtain information from attributed graphs. One of the most important is graph pattern matching, which is th...
Conference Paper
We propose a new approach to solve graph isomorphism using parameterized matching. To find isomorphism between two graphs, one graph is linearized, i.e., represented as a graph walk that covers all nodes and edges such that each element is represented by a parameter. Next, we match the graph linearization on the second graph, searching for a biject...
Article
Regular expressions play an important role in various fields in computer science. However, handling many regular expressions in parallel requires huge computation resources. Therefore, it is necessary to find and eliminate overlapping regular expressions. In this paper, we consider a special type of regular expressions: expressions comprised of cha...
Conference Paper
This paper defines a new string matching problem by combining two paradigms: function matching and δγ-matching. The result is an approximate variant of function matching where two equal-length strings X and Y match if there exists a function that maps X to a string X′ such that X′ and Y are δγ- similar. We propose an O(nm) algorithm for finding all...
Article
Finding the Longest Common Subsequence in Weighted Sequences (WLCS) is an important problem in computational biology and bioinformatics. In this paper, we model this problem as a multiobjective optimization problem. As a result, we propose a novel and efficient algorithm that not only finds a WLCS but also the set of all possible solutions. The tim...
Conference Paper
Full-text available
This paper defines a new pattern matching problem by combining two paradigms: δγ–matching and parameterized matching. The solution is essentially obtained by a combination of bitparallel techniques and a reduction to a graph matching problem. The time complexity of the algorithm is O(nm), assuming text size n, pattern size m and a constant size alp...

Network

Cited By