Costas Iliopoulos
Costas Iliopoulos
Professor in Algorithm Design & Bioinformatics
Verified email at - Homepage
Cited by
Cited by
Parallel construction of a suffix tree with applications
A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin
Algorithmica 3, 347-365, 1988
String-matching techniques for musical similarity and melodic recognition
T Crawford
Melodic Similarity: Concepts, Procedures, and Application, 1998
Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix
CS Iliopoulos
siam Journal on Computing 18 (4), 658-669, 1989
Optimal superprimitivity testing for strings
A Apostolico, M Farach, CS Iliopoulos
Information Processing Letters 39 (1), 17-20, 1991
Order-preserving matching
J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ...
Theoretical Computer Science 525, 68-79, 2014
Predicting the functional consequences of non-synonymous DNA sequence variants—evaluation of bioinformatics tools and development of a consensus strategy
K Frousios, CS Iliopoulos, T Schlitt, MA Simpson
Genomics 102 (4), 223-228, 2013
Algorithms for computing approximate repetitions in musical sequences
E Cambouropoulos, M Crochemore, C Iliopoulos, L Mouchard, Y Pinzon
International Journal of Computer Mathematics 79 (11), 1135-1148, 2002
A fast and practical bit-vector algorithm for the longest common subsequence problem
M Crochemore, CS Iliopoulos, YJ Pinzon, JF Reid
Information Processing Letters 80 (6), 279-285, 2001
Pattern processing in melodic sequences: Challenges, caveats and prospects
E Cambouropoulos, T Crawford, CS Iliopoulos
Computers and the Humanities 35 (1), 9-21, 2001
Covering a string
CS Iliopoulos, DWG Moore, K Park
Algorithmica 16 (3), 288-297, 1996
A characterization of the squares in a Fibonacci string
CS Iliopoulos, D Moore, WF Smyth
Theoretical Computer Science 172 (1-2), 281-291, 1997
GenMap: ultra-fast computation of genome mappability
C Pockrandt, M Alzamel, CS Iliopoulos, K Reinert
Bioinformatics 36 (12), 3687-3692, 2020
Music Genre Classification via Compressive Sampling.
KK Chang, JSR Jang, CS Iliopoulos
ISMIR, 387-392, 2010
Truncated suffix trees and their application to data compression
JC Na, A Apostolico, CS Iliopoulos, K Park
Theoretical Computer Science 304 (1-3), 87-101, 2003
New efficient algorithms for the LCS and constrained LCS problems
CS Iliopoulos, MS Rahman
Information Processing Letters 106 (1), 13-18, 2008
Extracting powers and periods in a word from its runs structure
M Crochemore, CS Iliopoulos, M Kubica, J Radoszewski, W Rytter, ...
Theoretical Computer Science 521, 29-41, 2014
Approximate string matching with gaps
M Crochemore, CS Iliopoulos, C Makris, W Rytter, AK Tsakalidis, ...
Nord. J. Comput. 9 (1), 54-65, 2002
A new efficient algorithm for computing the longest common subsequence
CS Iliopoulos, MS Rahman
Theory of Computing Systems 45 (2), 355-371, 2009
Finding patterns with variable length gaps or don’t cares
MS Rahman, CS Iliopoulos, I Lee, M Mohamed, WF Smyth
Computing and Combinatorics: 12th Annual International Conference, COCOON …, 2006
Order-preserving incomplete suffix trees and order-preserving indexes
M Crochemore, CS Iliopoulos, T Kociumaka, M Kubica, A Langiu, ...
String Processing and Information Retrieval: 20th International Symposium …, 2013
The system can't perform the operation now. Try again later.
Articles 1–20