Costas S. Iliopoulos
King's College London(GB)London Mathematical Laboratory(GB)
Publications by Year
Research Areas
Algorithms and Data Compression, semigroups and automata theory, DNA and Biological Computing, Genomics and Phylogenetic Studies, Network Packet Processing and Optimization
Most-Cited Works
- → GenMap: ultra-fast computation of genome mappability(2020)244 cited
- → 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(1989)127 cited
- Computer Science and Information Systems (FedCSIS), 2011 Federated Conference on(2011)
- → Optimal superprimitivity testing for strings(1991)104 cited
- → Predicting the functional consequences of non-synonymous DNA sequence variants — evaluation of bioinformatics tools and development of a consensus strategy(2013)99 cited
- → Order-preserving matching(2013)88 cited
- → A fast and practical bit-vector algorithm for the Longest Common Subsequence problem