Finding Motifs with Gaps. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (ISMIR, 2000)

Fast Evolutionary Chains. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (SOFSEM, 2000)

Computing Approximate Repetitions in Musical Sequences. - Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Yoan J. Pinzón (Stringology, 2000)

Approximate String Matching in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Yoan J. Pinzón (Stringology, 2001)

The Max-Shift Algorithm for Approximate String Matching. - Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (WAE, 2001)

Computing Evolutionary Chains in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Electron. J. Comb., 2001)

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón; James F. Reid (Inf. Process. Lett., 2001)

String algorithms on sequence comparison. - Yoan José Pinzón Ardila (2001)

Algorithms for Computing Approximate Repetitions in Musical Sequences. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (Int. J. Comput. Math., 2002)

Recovering an LCS in O(n2/w) Time and Space. - Costas S. Iliopoulos; Yoan J. Pinzón (Rev. Colomb. de Computación, 2002)

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón (SPIRE, 2003)

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Fundam. Informaticae, 2003)

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS. - Kjell Lemström; Gonzalo Navarro 001; Yoan J. Pinzón (SPIRE, 2004)

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (SOFSEM, 2005)

Necklace Swap Problem for Rhythmic Similarity Measures. - Yoan José Pinzón Ardila; Raphaël Clifford; Manal Mohamed 001 (SPIRE, 2005)

Linear Time Algorithm for the Generalised Longest Common Repeat Problem. - Inbok Lee; Yoan José Pinzón Ardila (SPIRE, 2005)

Approximation algorithm for the cyclic swap problem. - Yoan José Pinzón Ardila; Costas S. Iliopoulos; Gad M. Landau; Manal Mohamed 001 (Stringology, 2005)

New Bit-Parallel Indel-Distance Algorithm. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (WEA, 2005)

Bit-parallel (delta, gamma)-matching and suffix automata. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón; Alejandro Salinger (J. Discrete Algorithms, 2005)

Practical algorithms for transposition-invariant string-matching. - Kjell Lemström; Gonzalo Navarro 001; Yoan J. Pinzón (J. Discrete Algorithms, 2005)

Simple Algorithm for Sorting the Fibonacci String Rotations. - Manolis Christodoulakis; Costas S. Iliopoulos; Yoan José Pinzón Ardila (SOFSEM, 2006)

A novel ab-initio genetic-based approach for protein folding prediction. - Sergio Raul Duarte Torres; David Camilo Becerra Romero; Luis Fernando Niño Vasquez; Yoan José Pinzón Ardila (GECCO, 2007)

A Simple Algorithm for Finding Exact Common Repeats. - Inbok Lee; Yoan J. Pinzón (IEICE Trans. Inf. Syst., 2007)

Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. - Manolis Christodoulakis; Geoffrey Brian Golding; Costas S. Iliopoulos; Yoan José Pinzón Ardila; William F. Smyth (J. Comput. Biol., 2007)

Sobre el Longest Common Subsequence: Extensiones y Algoritmos. - Wilson Soto; Yoan J. Pinzón (Rev. Colomb. de Computación, 2007)

delta-gamma-Parameterized Matching. - Inbok Lee; Juan Mendivelso; Yoan J. Pinzón (SPIRE, 2008)

Una metaheurística híbrida aplicada a un problema de planificación de rutas. - Daniel Soto 001; Wilson Soto; Yoan J. Pinzón (Rev. Avances en Sistemas Informática, 2008)

A New Chinese Remainder Algorithm for Image-based Encryption. - Sérgio Duarte; David Camilo Becerra Romero; Yoan José Pinzón Ardila (Rev. Colomb. de Computación, 2009)

Pattern-Matching with Bounded Gaps in Genomic Sequences. - Yoan J. Pinzón; Shu Wang (Rev. Colomb. de Computación, 2009)

An algorithm for Constrained LCS. - David Becerra; Wilson Soto; Luis F. Niño; Yoan J. Pinzón (AICCSA, 2010)

Approximate Function Matching under δ- and γ- Distances. - Juan Mendivelso; Inbok Lee; Yoan J. Pinzón (SPIRE, 2012)

A Multiobjective Approach to the Weighted Longest Common Subsequence Problem. - David Becerra; Juan Mendivelso; Yoan J. Pinzón (Stringology, 2012)

Finding overlaps within regular expressions with variable-length gaps. - Juan Mendivelso; Yoan J. Pinzón; Inbok Lee (RACS, 2013)

Solving Graph Isomorphism Using Parameterized Matching. - Juan Mendivelso; Sunghwan Kim; Sameh Elnikety; Yuxiong He; Seung-won Hwang; Yoan J. Pinzón (SPIRE, 2013)

A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem. - Daniel Soto 001; Wilson Soto; Yoan J. Pinzón (Int. J. Comb. Optim. Probl. Informatics, 2013)

Approximate Abelian Periods to Find Motifs in Biological Sequences. - Juan Mendivelso; Camilo Pino; Luis F. Niño; Yoan J. Pinzón (CIBB, 2014)

Efficient Algorithm for δ-Approximate Jumbled Pattern Matching. - Iván Castellanos; Yoan J. Pinzón (Stringology, 2015)

Parameterized Matching: Solutions and Extensions. - Juan Mendivelso; Yoan J. Pinzón (Stringology, 2015)

A multiobjective optimization algorithm for the weighted LCS. - David Becerra; Juan Mendivelso; Yoan J. Pinzón (Discret. Appl. Math., 2016)

Segment and Fenwick Trees for Approximate Order Preserving Matching. - Rafael Niquefa; Juan Mendivelso; Germán Jairo Hernández; Yoan J. Pinzón (WEA, 2017)

A brief history of parameterized matching problems. - Juan Mendivelso; Sharma V. Thankachan; Yoan J. Pinzón (Discret. Appl. Math., 2020)