Yoan J. Pinzon - Citegraph

Author Info

Name	Affiliation	Papers
YOAN J. PINZON	Dept. Computer Science, King’s College London, WC2R 2LS London, England	29
Collaborators	Citations	PageRank
26	158	16.81
Referers	Referees	References
240	307	307

Search Limit

100307

Publications (29 rows)

Collaborators (26 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A brief history of parameterized matching problems	0	0.34	2020
A multiobjective optimization algorithm for the weighted LCS	0	0.34	2016
Parameterized Matching: Solutions And Extensions	4	0.46	2015
Efficient Algorithm for δ-Approximate Jumbled Pattern Matching.	0	0.34	2015
A Parallel Nash Genetic Algorithm For The 3d Orthogonal Knapsack Problem	0	0.34	2013
Solving Graph Isomorphism Using Parameterized Matching	4	0.54	2013
Finding overlaps within regular expressions with variable-length gaps	2	0.42	2013
Approximate function matching under δ- and γ- distances	3	0.38	2012
An algorithm for Constrained LCS	0	0.34	2010
Pattern-Matching with Bounded Gaps in Genomic Sequences	0	0.34	2009
Una metaheurística híbrida aplicada a un problema de planificación de rutas	0	0.34	2008
delta-gamma-Parameterized Matching	0	0.34	2008
A Simple Algorithm for Finding Exact Common Repeats	1	0.38	2007
Sobre el Longest Common Subsequence: Extensiones y Algoritmos	0	0.34	2007
Practical algorithms for transposition-invariant string-matching	7	0.55	2005
Bit-parallel (delta, gamma)-matching and suffix automata	7	0.66	2005
Fast bit-vector algorithms for approximate string matching under indel distance	3	0.43	2005
New bit-parallel indel-distance algorithm	2	0.41	2005
Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS	2	0.42	2004
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval	0	0.34	2003
Recovering an LCS in O(n2/w) Time and Space	2	0.39	2002
Algorithms For Computing Approximate Repetitions In Musical Sequences	39	2.76	2002
Approximate String Matching in Musical Sequences	9	0.69	2001
The Max-Shift Algorithm for Approximate String Matching	10	0.72	2001
Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms	4	0.46	2001
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.	49	1.99	2001
Computing Evolutionary Chains in Musical Sequences	4	0.53	2001
Fast Evolutionary Chains	1	0.40	2000
Finding Motifs with Gaps	5	0.83	2000