Yoan J. Pinzón

Publication Activity (10 Years)

Years Active: 2000-2020
Publications (10 Years): 5

Top Topics

Pattern Matching

Multiobjective Genetic Algorithm

Top Venues

Discret. Appl. Math.

Publications

Juan Mendivelso, Sharma V. Thankachan, Yoan J. Pinzón
A brief history of parameterized matching problems. Discret. Appl. Math. 274 (2020)
Rafael Niquefa, Juan Mendivelso, Germán Jairo Hernández, Yoan J. Pinzón
Segment and Fenwick Trees for Approximate Order Preserving Matching. WEA (2017)
David Becerra, Juan Mendivelso, Yoan J. Pinzón
A multiobjective optimization algorithm for the weighted LCS. Discret. Appl. Math. 212 (2016)
Juan Mendivelso, Yoan J. Pinzón
Parameterized Matching: Solutions and Extensions. Stringology (2015)
Iván Castellanos, Yoan J. Pinzón
Efficient Algorithm for δ-Approximate Jumbled Pattern Matching. Stringology (2015)
Juan Mendivelso, Camilo Pino, Luis F. Niño, Yoan J. Pinzón
Approximate Abelian Periods to Find Motifs in Biological Sequences. CIBB (2014)
Juan Mendivelso, Sunghwan Kim, Sameh Elnikety, Yuxiong He, Seung-won Hwang, Yoan J. Pinzón
Solving Graph Isomorphism Using Parameterized Matching. SPIRE (2013)
Juan Mendivelso, Yoan J. Pinzón, Inbok Lee
Finding overlaps within regular expressions with variable-length gaps. RACS (2013)
Daniel Soto, Wilson Soto, Yoan J. Pinzón
A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem. Int. J. Comb. Optim. Probl. Informatics 4 (3) (2013)
Juan Mendivelso, Inbok Lee, Yoan J. Pinzón
Approximate Function Matching under δ- and γ- Distances. SPIRE (2012)
David Becerra, Juan Mendivelso, Yoan J. Pinzón
A Multiobjective Approach to the Weighted Longest Common Subsequence Problem. Stringology (2012)
David Becerra, Wilson Soto, Luis F. Niño, Yoan J. Pinzón
An algorithm for Constrained LCS. AICCSA (2010)
Yoan J. Pinzón, Shu Wang
Pattern-Matching with Bounded Gaps in Genomic Sequences. Rev. Colomb. de Computación 10 (1) (2009)
Inbok Lee, Juan Mendivelso, Yoan J. Pinzón
delta-gamma-Parameterized Matching. SPIRE (2008)
Daniel Soto, Wilson Soto, Yoan J. Pinzón
Una metaheurística híbrida aplicada a un problema de planificación de rutas. Rev. Avances en Sistemas Informática 5 (3) (2008)
Wilson Soto, Yoan J. Pinzón
Sobre el Longest Common Subsequence: Extensiones y Algoritmos. Rev. Colomb. de Computación 8 (2) (2007)
Inbok Lee, Yoan J. Pinzón
A Simple Algorithm for Finding Exact Common Repeats. IEICE Trans. Inf. Syst. (12) (2007)
Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM (2005)
Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
New Bit-Parallel Indel-Distance Algorithm. WEA (2005)
Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger
)-matching and suffix automata. J. Discrete Algorithms 3 (2-4) (2005)
Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón
Practical algorithms for transposition-invariant string-matching. J. Discrete Algorithms 3 (2-4) (2005)
Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón
Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS. SPIRE (2004)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Informaticae 56 (1-2) (2003)
Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. SPIRE (2003)
Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón
Algorithms for Computing Approximate Repetitions in Musical Sequences. Int. J. Comput. Math. 79 (11) (2002)
Costas S. Iliopoulos, Yoan J. Pinzón
/w) Time and Space. Rev. Colomb. de Computación 3 (1) (2002)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
Computing Evolutionary Chains in Musical Sequences. Electron. J. Comb. 8 (2) (2001)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE (2001)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. Inf. Process. Lett. 80 (6) (2001)
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón
Approximate String Matching in Musical Sequences. Stringology (2001)
Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón
The Max-Shift Algorithm for Approximate String Matching. WAE (2001)
Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón
Computing Approximate Repetitions in Musical Sequences. Stringology (2000)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
Finding Motifs with Gaps. ISMIR (2000)
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón
Fast Evolutionary Chains. SOFSEM (2000)