default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoan J. Pinzón
Person information
- affiliation: National University of Colombia, Bogotá, Colombia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j16]Juan Mendivelso
, Sharma V. Thankachan, Yoan J. Pinzón:
A brief history of parameterized matching problems. Discret. Appl. Math. 274: 103-115 (2020)
2010 – 2019
- 2017
- [c25]Rafael Niquefa, Juan Mendivelso, Germán Jairo Hernández, Yoan J. Pinzón:
Segment and Fenwick Trees for Approximate Order Preserving Matching. WEA 2017: 131-143 - 2016
- [j15]David Becerra, Juan Mendivelso, Yoan J. Pinzón:
A multiobjective optimization algorithm for the weighted LCS. Discret. Appl. Math. 212: 37-47 (2016) - 2015
- [c24]Iván Castellanos, Yoan J. Pinzón:
Efficient Algorithm for δ-Approximate Jumbled Pattern Matching. Stringology 2015: 47-56 - [c23]Juan Mendivelso, Yoan J. Pinzón:
Parameterized Matching: Solutions and Extensions. Stringology 2015: 118-131 - 2014
- [c22]Juan Mendivelso, Camilo Pino, Luis F. Niño, Yoan J. Pinzón:
Approximate Abelian Periods to Find Motifs in Biological Sequences. CIBB 2014: 121-130 - 2013
- [j14]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): 2-10 (2013) - [c21]Juan Mendivelso, Yoan J. Pinzón, Inbok Lee:
Finding overlaps within regular expressions with variable-length gaps. RACS 2013: 16-21 - [c20]Juan Mendivelso, Sunghwan Kim, Sameh Elnikety, Yuxiong He, Seung-won Hwang, Yoan J. Pinzón:
Solving Graph Isomorphism Using Parameterized Matching. SPIRE 2013: 230-242 - 2012
- [c19]Juan Mendivelso, Inbok Lee, Yoan J. Pinzón:
Approximate Function Matching under δ- and γ- Distances. SPIRE 2012: 348-359 - [c18]David Becerra, Juan Mendivelso, Yoan J. Pinzón:
A Multiobjective Approach to the Weighted Longest Common Subsequence Problem. Stringology 2012: 64-74 - 2010
- [c17]David Becerra, Wilson Soto, Luis F. Niño, Yoan J. Pinzón:
An algorithm for Constrained LCS. AICCSA 2010: 1-7
2000 – 2009
- 2009
- [j13]Sérgio Duarte, David Camilo Becerra Romero, Yoan José Pinzón Ardila:
A New Chinese Remainder Algorithm for Image-based Encryption. Rev. Colomb. de Computación 10(1): 45-60 (2009) - [j12]Yoan J. Pinzón, Shu Wang:
Pattern-Matching with Bounded Gaps in Genomic Sequences. Rev. Colomb. de Computación 10(1): 110-119 (2009) - 2008
- [j11]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): 135-144 (2008) - [c16]Inbok Lee, Juan Mendivelso, Yoan J. Pinzón:
delta-gamma-Parameterized Matching. SPIRE 2008: 236-248 - 2007
- [j10]Inbok Lee, Yoan J. Pinzón:
A Simple Algorithm for Finding Exact Common Repeats. IEICE Trans. Inf. Syst. 90-D(12): 2096-2099 (2007) - [j9]Manolis Christodoulakis, Geoffrey Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth:
Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. J. Comput. Biol. 14(7): 1001-1010 (2007) - [j8]Wilson Soto, Yoan J. Pinzón:
Sobre el Longest Common Subsequence: Extensiones y Algoritmos. Rev. Colomb. de Computación 8(2): 79-100 (2007) - [c15]Sergio Raul Duarte Torres, David Camilo Becerra Romero, Luis Fernando Niño Vasquez, Yoan José Pinzón Ardila:
A novel ab-initio genetic-based approach for protein folding prediction. GECCO 2007: 393-400 - 2006
- [c14]Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila:
Simple Algorithm for Sorting the Fibonacci String Rotations. SOFSEM 2006: 218-225 - 2005
- [j7]Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzón, Alejandro Salinger:
Bit-parallel (delta, gamma)-matching and suffix automata. J. Discrete Algorithms 3(2-4): 198-214 (2005) - [j6]Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón:
Practical algorithms for transposition-invariant string-matching. J. Discrete Algorithms 3(2-4): 267-292 (2005) - [c13]Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara:
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM 2005: 380-384 - [c12]Inbok Lee, Yoan José Pinzón Ardila:
Linear Time Algorithm for the Generalised Longest Common Repeat Problem. SPIRE 2005: 191-201 - [c11]Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed:
Necklace Swap Problem for Rhythmic Similarity Measures. SPIRE 2005: 234-245 - [c10]Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed:
Approximation algorithm for the cyclic swap problem. Stringology 2005: 190-200 - [c9]Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara:
New Bit-Parallel Indel-Distance Algorithm. WEA 2005: 380-390 - 2004
- [c8]Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzón:
Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS. SPIRE 2004: 74-75 - 2003
- [j5]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Informaticae 56(1-2): 89-103 (2003) - [c7]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: 211-223 - 2002
- [j4]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): 1135-1148 (2002) - [j3]Costas S. Iliopoulos, Yoan J. Pinzón:
Recovering an LCS in O(n2/w) Time and Space. Rev. Colomb. de Computación 3(1): 41-51 (2002) - 2001
- [b1]Yoan José Pinzón Ardila:
String algorithms on sequence comparison. King's College London, UK, 2001 - [j2]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Computing Evolutionary Chains in Musical Sequences. Electron. J. Comb. 8(2) (2001) - [j1]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): 279-285 (2001) - [c6]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE 2001: 59-67 - [c5]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón:
Approximate String Matching in Musical Sequences. Stringology 2001: 26-36 - [c4]Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón:
The Max-Shift Algorithm for Approximate String Matching. WAE 2001: 13-25 - 2000
- [c3]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Finding Motifs with Gaps. ISMIR 2000 - [c2]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Fast Evolutionary Chains. SOFSEM 2000: 307-318 - [c1]Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón:
Computing Approximate Repetitions in Musical Sequences. Stringology 2000: 49-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
