Yoan J. Pinzón

According to our database, Yoan J. Pinzón authored at least 41 papers between 2000 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

A brief history of parameterized matching problems.

Juan Mendivelso, Sharma V. Thankachan, Yoan J. Pinzón

Discret. Appl. Math., 2020

2017

Segment and Fenwick Trees for Approximate Order Preserving Matching.

Rafael Niquefa, Juan Mendivelso, Germán Jairo Hernández, Yoan J. Pinzón

Proceedings of the Applied Computer Sciences in Engineering, 2017

2016

A multiobjective optimization algorithm for the weighted LCS.

David Becerra, Juan Mendivelso, Yoan J. Pinzón

Discret. Appl. Math., 2016

2015

Parameterized Matching: Solutions and Extensions.

Juan Mendivelso, Yoan J. Pinzón

Proceedings of the Prague Stringology Conference 2015, 2015

Efficient Algorithm for δ-Approximate Jumbled Pattern Matching.

Iván Castellanos, Yoan J. Pinzón

Proceedings of the Prague Stringology Conference 2015, 2015

2014

Approximate Abelian Periods to Find Motifs in Biological Sequences.

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

Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2014

2013

A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem.

Daniel Soto, Wilson Soto, Yoan J. Pinzón

Int. J. Comb. Optim. Probl. Informatics, 2013

Solving Graph Isomorphism Using Parameterized Matching.

Juan Mendivelso, Sunghwan Kim, Sameh Elnikety, Yuxiong He, Seung-won Hwang, Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2013

Finding overlaps within regular expressions with variable-length gaps.

Juan Mendivelso, Yoan J. Pinzón, Inbok Lee

Proceedings of the Research in Adaptive and Convergent Systems, 2013

2012

A Multiobjective Approach to the Weighted Longest Common Subsequence Problem.

David Becerra, Juan Mendivelso, Yoan J. Pinzón

Proceedings of the Prague Stringology Conference 2012, 2012

Approximate Function Matching under δ- and γ- Distances.

Juan Mendivelso, Inbok Lee, Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2012

2010

An algorithm for Constrained LCS.

David Becerra, Wilson Soto, Luis F. Niño, Yoan J. Pinzón

Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009

Pattern-Matching with Bounded Gaps in Genomic Sequences.

Yoan J. Pinzón, Shu Wang

Rev. Colomb. de Computación, 2009

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

2008

Una metaheurística híbrida aplicada a un problema de planificación de rutas.

Daniel Soto, Wilson Soto, Yoan J. Pinzón

Rev. Avances en Sistemas Informática, 2008

delta-gamma-Parameterized Matching.

Inbok Lee, Juan Mendivelso, Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2008

2007

Sobre el Longest Common Subsequence: Extensiones y Algoritmos.

Wilson Soto, Yoan J. Pinzón

Rev. Colomb. de Computación, 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

A Simple Algorithm for Finding Exact Common Repeats.

Inbok Lee, Yoan J. Pinzón

IEICE Trans. Inf. Syst., 2007

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

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006

Simple Algorithm for Sorting the Fibonacci String Rotations.

Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005

Practical algorithms for transposition-invariant string-matching.

Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón

J. Discrete Algorithms, 2005

Bit-parallel (<i>delta</i>, <i>gamma</i>)-matching and suffix automata.

Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger

J. Discrete Algorithms, 2005

New Bit-Parallel Indel-Distance Algorithm.

Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Approximation algorithm for the cyclic swap problem.

Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed

Proceedings of the Prague Stringology Conference, 2005

Linear Time Algorithm for the Generalised Longest Common Repeat Problem.

Inbok Lee, Yoan José Pinzón Ardila

Proceedings of the String Processing and Information Retrieval, 2005

Necklace Swap Problem for Rhythmic Similarity Measures.

Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed

Proceedings of the String Processing and Information Retrieval, 2005

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.

Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2004

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.

Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2004

2003

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.

Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón

Proceedings of the String Processing and Information Retrieval, 2003

2002

Recovering an LCS in O(n²/w) Time and Space.

Costas S. Iliopoulos, Yoan J. Pinzón

Rev. Colomb. de Computación, 2002

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

2001

String algorithms on sequence comparison.

Yoan José Pinzón Ardila

PhD thesis, 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

Computing Evolutionary Chains in Musical Sequences.

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón

Electron. J. Comb., 2001

The Max-Shift Algorithm for Approximate String Matching.

Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón

Proceedings of the Algorithm Engineering, 2001

Approximate String Matching in Musical Sequences.

Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón

Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000

Computing Approximate Repetitions in Musical Sequences.

Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón

Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

Fast Evolutionary Chains.

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Finding Motifs with Gaps.

Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón

Proceedings of the ISMIR 2000, 2000