#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2008

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Juan Mendivelso, Yoan J. Pinzón, Inbok Lee
- RACS
- 2013

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 characters… (More)

- Juan Mendivelso, Inbok Lee, Yoan J. Pinzón
- SPIRE
- 2012

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 bijective… (More)

- Inbok Lee, Juan Mendivelso, Yoan J. Pinzón
- SPIRE
- 2008

- Juan Mendivelso, Yoan J. Pinzón
- Stringology
- 2015

- David Becerra, Juan Mendivelso, Yoan J. Pinzón
- Stringology
- 2012

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 time… (More)

- David Becerra, Juan Mendivelso, Yoan J. Pinzón
- Discrete Applied Mathematics
- 2016

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 andmore precise encoding paradigm ofmolecular structures. The longest common subsequence (LCS) has been an extensively studied technique to compute… (More)

- Juan Mendivelso, Yoan Pinzón
- 2014 9th Computing Colombian Conference (9CCC)
- 2014

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 the problem… (More)

- Jan Žd’́arek, Gabriela Andrejková, +27 authors Michal Ziv-Ukelson
- 2009

It is shown that cellular automata can be used for feature extraction of images in image pattern matching systems. The problem under consideration is an image pattern matching problem of a single image against a database of LEGO bricks. The use of cellular automata is illustrated, and solves this classical content-based image retrieval problem in near… (More)

- Juan Mendivelso, Camilo Pino, Luis F. Niño, Yoan J. Pinzón
- CIBB
- 2014

- ‹
- 1
- ›