Analysis of an Algorithm for Composition of Binary Quadratic Forms. - Costas S. Iliopoulos (J. Algorithms, 1982)

Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups. - Costas S. Iliopoulos (European Conference on Computer Algebra (2), 1985)

Gaussian Elimination over a Euclidean Ring. - Costas S. Iliopoulos (European Conference on Computer Algebra (2), 1985)

Computing a Basis for a Finite Abelian p-Group. - W. M. Beynon; Costas S. Iliopoulos (Inf. Process. Lett., 1985)

Analysis of Algorithms on Problems in General Abelian Groups. - Costas S. Iliopoulos (Inf. Process. Lett., 1985)

Computing in General Abelian Groups is Hard. - Costas S. Iliopoulos (Theor. Comput. Sci., 1985)

Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem. - Costas S. Iliopoulos (Acta Informatica, 1986)

On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. - Alberto Apostolico; Costas S. Iliopoulos; Robert Paige (Parallel Algorithms and Architectures, 1987)

Parallel Construction of a Suffix Tree with Applications. - Alberto Apostolico; Costas S. Iliopoulos; Gad M. Landau; Baruch Schieber; Uzi Vishkin (Algorithmica, 1988)

On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. - Costas S. Iliopoulos (Theor. Comput. Sci., 1988)

PRAM Algorithms for Identifying Polygon Similarity. - Costas S. Iliopoulos; William F. Smyth (Optimal Algorithms, 1989)

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. - Costas S. Iliopoulos (SIAM J. Comput., 1989)

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. - Costas S. Iliopoulos (SIAM J. Comput., 1989)

Optimal Superprimitivity Testing for Strings. - Alberto Apostolico; Martin Farach; Costas S. Iliopoulos (Inf. Process. Lett., 1991)

Optimal Algorithms for Computing the canonical form of a circular string. - Costas S. Iliopoulos; William F. Smyth (Theor. Comput. Sci., 1992)

The Subtree Max Gap Problem with Application to Parallel String Covering. - Amir M. Ben-Amram; Omer Berkman; Costas S. Iliopoulos; Kunsoo Park (SODA, 1994)

A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. - Clive N. Galley; Costas S. Iliopoulos (Parallel Process. Lett., 1994)

Parallel RAM Algorithms for Factorizing Words. - Jacqueline W. Daykin; Costas S. Iliopoulos; William F. Smyth (Theor. Comput. Sci., 1994)

The Subtree Max Gap Problem with Application to Parallel String Covering. - Omer Berkman; Costas S. Iliopoulos; Kunsoo Park (Inf. Comput., 1995)

A fast average case algorithm for lyndon decomposition. - Costas S. Iliopoulos; William F. Smyth (Int. J. Comput. Math., 1995)

Covering a String. - Costas S. Iliopoulos; Dennis W. G. Moore; Kunsoo Park (Algorithmica, 1996)

On the lower bound for parallel string matching. - Clive N. Galley; Costas S. Iliopoulos (Int. J. Comput. Math., 1996)

A Pram Algorithm for a Special Case of the Set Partition Problem. - Clive N. Galley; Costas S. Iliopoulos (Parallel Algorithms Appl., 1996)

Optimal Parallel Superprimitivity Testing for Square Arrays. - Costas S. Iliopoulos; Maureen Korda (Parallel Process. Lett., 1996)

A Work-Time Optimal Algorithm for Computing All String Covers. - Costas S. Iliopoulos; Kunsoo Park (Theor. Comput. Sci., 1996)

A Characterization of the Squares in a Fibonacci String. - Costas S. Iliopoulos; Dennis W. G. Moore; William F. Smyth (Theor. Comput. Sci., 1997)

Massively Parallel Suffix Array Construction. - Costas S. Iliopoulos; Maureen Korda (SOFSEM, 1998)

Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract). - Costas S. Iliopoulos; James F. Reid (Stringology, 1998)

Two-Dimensional Prefix String Matching and Covering on Square Matrices. - Maxime Crochemore; Costas S. Iliopoulos; Maureen Korda (Algorithmica, 1998)

Quasiperiodicity: From Detection to Normal Forms. - Costas S. Iliopoulos; Laurent Mouchard (J. Autom. Lang. Comb., 1999)

Quasiperiodicity and String Covering. - Costas S. Iliopoulos; Laurent Mouchard (Theor. Comput. Sci., 1999)

Finding Motifs with Gaps. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (ISMIR, 2000)

Fast Evolutionary Chains. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (SOFSEM, 2000)

Computing Approximate Repetitions in Musical Sequences. - Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Yoan J. Pinzón (Stringology, 2000)

Optimal parallel analysis and decomposition of partially occluded strings. - Costas S. Iliopoulos; James F. Reid (Parallel Comput., 2000)

Combinatorial Algorithms - Preface. - Costas S. Iliopoulos (Theor. Comput. Sci., 2000)

Approximate String Matching in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Yoan J. Pinzón (Stringology, 2001)

The Max-Shift Algorithm for Approximate String Matching. - Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (WAE, 2001)

Computing Evolutionary Chains in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Electron. J. Comb., 2001)

Decomposition of Partially Occluded Strings in the Presence of Errors. - Costas S. Iliopoulos; James F. Reid (Int. J. Pattern Recognit. Artif. Intell., 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)

Distributed Pattern Matching Using Finite Automata. - Jan Holub 001; Costas S. Iliopoulos; Borivoj Melichar; Laurent Mouchard (J. Autom. Lang. Comb., 2001)

On-Line Validation and Analysis of Partially Occluded Images. - Costas S. Iliopoulos; Jamie Simpson (J. Autom. Lang. Comb., 2001)

Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects. - Emilios Cambouropoulos; Tim Crawford; Costas S. Iliopoulos (Comput. Humanit., 2001)

Approximate Musical Evolution. - Tim Crawford; Costas S. Iliopoulos; Russel L. Winder; Haifeng Yu (Comput. Humanit., 2001)

Approximate periods of strings. - Jeong Seop Sim; Costas S. Iliopoulos; Kunsoo Park; William F. Smyth (Theor. Comput. Sci., 2001)

Three Heuristics for delta-Matching: delta-BM Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (CPM, 2002)

Identifying Occurrences of Maximal Pairs in Multiple Strings. - Costas S. Iliopoulos; Christos Makris 001; Spyros Sioutas; Athanasios K. Tsakalidis; Kostas Tsichlas (CPM, 2002)

Validation and Decomposition of Partially Occluded Images. - Costas S. Iliopoulos; Manal Mohamed 001 (SOFSEM, 2002)

String Matching with Gaps for Musical Melodic Recognition. - Costas S. Iliopoulos; Masahiro Kurokawa (Stringology, 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)

On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. - Aspassia Daskalopulu; Costas S. Iliopoulos; Manal Mohamed 001 (Int. J. Comput. Math., 2002)

Approximate String Matching with Gaps. - Maxime Crochemore; Costas S. Iliopoulos; Christos Makris 001; Wojciech Rytter; Athanasios K. Tsakalidis; Kostas Tsichlas (Nord. J. Comput., 2002)

Recovering an LCS in O(n2/w) Time and Space. - Costas S. Iliopoulos; Yoan J. Pinzón (Rev. Colomb. de Computación, 2002)

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón (SPIRE, 2003)

Computing the Minimum k-Cover of a String. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (Stringology, 2003)

Computing the Repetitions in a Weighted Sequence. - Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis (Stringology, 2003)

Occurrence and Substring Heuristics for i-Matching. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq (Fundam. Informaticae, 2003)

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzón (Fundam. Informaticae, 2003)

On special families of morphisms related to [delta]-matching and don't care symbols. - Richard Cole 001; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 2003)

Editorial. - Diane M. Donovan; Costas S. Iliopoulos; Mirka Miller (J. Autom. Lang. Comb., 2003)

String Regularities with Don't Cares. - Costas S. Iliopoulos; Manal Mohamed 001; Laurent Mouchard; Katerina Perdikuri; William F. Smyth; Athanasios K. Tsakalidis (Nord. J. Comput., 2003)

Truncated suffix trees and their application to data compression. - Joong Chae Na; Alberto Apostolico; Costas S. Iliopoulos; Kunsoo Park (Theor. Comput. Sci., 2003)

String Algorithmics. - Costas S. Iliopoulos; Thierry Lecroq (College Publications, 2004)

String Matching with Swaps in a Weighted Sequence. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (CIS, 2004)

Efficient Algorithms for Handling Molecular Weighted Sequences. - Costas S. Iliopoulos; Christos Makris 001; Yannis Panagis; Katerina Perdikuri; Evangelos Theodoridis; Athanasios K. Tsakalidis (IFIP TCS, 2004)

Longest Repeats with a Block of Don't Cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (LATIN, 2004)

Motif Extraction from Weighted Sequences. - Costas S. Iliopoulos; Katerina Perdikuri; Evangelos Theodoridis; Athanasios K. Tsakalidis; Kostas Tsichlas (SPIRE, 2004)

Approximate string matching for music analysis. - Raphaël Clifford; Costas S. Iliopoulos (Soft Comput., 2004)

Faster Algorithms for delta, gamma-Matching and Related Problems. - Peter Clifford; Raphaël Clifford; Costas S. Iliopoulos (CPM, 2005)

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (ISMIR, 2005)

Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval. - Jeremy Pickens; Costas S. Iliopoulos (ISMIR, 2005)

Approximation algorithm for the cyclic swap problem. - Yoan José Pinzón Ardila; Costas S. Iliopoulos; Gad M. Landau; Manal Mohamed 001 (Stringology, 2005)

A first approach to finding common motifs with gaps. - Costas S. Iliopoulos; James A. M. McHugh; Pierre Peterlongo; Nadia Pisanti; Wojciech Rytter; Marie-France Sagot (Int. J. Found. Comput. Sci., 2005)

Approximate Seeds of Strings. - Manolis Christodoulakis; Costas S. Iliopoulos; Kunsoo Park; Jeong Seop Sim (J. Autom. Lang. Comb., 2005)

The Complexity of the Minimum k-Cover Problem. - Richard Cole 001; Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth; Lu Yang (J. Autom. Lang. Comb., 2005)

Computing the Repetitions in a Biological Weighted Sequence. - Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis (J. Autom. Lang. Comb., 2005)

Bit-parallel (delta, gamma)-matching and suffix automata. - Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro 001; Yoan J. Pinzón; Alejandro Salinger (J. Discrete Algorithms, 2005)

Implementing approximate regularities. - Manolis Christodoulakis; Costas S. Iliopoulos; Kunsoo Park; Jeong Seop Sim (Math. Comput. Model., 2005)

Computing the lambda-Seeds of a String. - Qing Guo 002; Hui Zhang 004; Costas S. Iliopoulos (AAIM, 2006)

Finding Patterns with Variable Length Gaps or Don't Cares. - M. Sohel Rahman; Costas S. Iliopoulos; Inbok Lee; Manal Mohamed 001; William F. Smyth (COCOON, 2006)

Approximate Matching in Weighted Sequences. - Amihood Amir; Costas S. Iliopoulos; Oren Kapah; Ely Porat (CPM, 2006)

Simple Algorithm for Sorting the Fibonacci String Rotations. - Manolis Christodoulakis; Costas S. Iliopoulos; Yoan José Pinzón Ardila (SOFSEM, 2006)

Computing the Minimum Approximate lambda-Cover of a String. - Qing Guo 002; Hui Zhang 004; Costas S. Iliopoulos (SPIRE, 2006)

Song classifications for dancing. - Manolis Christodoulakis; Costas S. Iliopoulos; Mohammad Sohel Rahman; William F. Smyth (Stringology, 2006)

Finding Common Motifs with Gaps Using Finite Automata. - Pavlos Antoniou; Jan Holub 001; Costas S. Iliopoulos; Borivoj Melichar; Pierre Peterlongo (CIAA, 2006)

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. - Costas S. Iliopoulos; Christos Makris 001; Yannis Panagis; Katerina Perdikuri; Evangelos Theodoridis; Athanasios K. Tsakalidis (Fundam. Informaticae, 2006)

Computation of Repetitions and Regularities of Biologically Weighted Sequences. - Manolis Christodoulakis; Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis; Kostas Tsichlas (J. Comput. Biol., 2006)

Longest repeats with a block of k don't cares. - Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Theor. Comput. Sci., 2006)

Algorithms for Computing the Longest Parameterized Common Subsequence. - Costas S. Iliopoulos; Marcin Kubica 001; M. Sohel Rahman; Tomasz Walen (CPM, 2007)

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. - Pavlos Antoniou; Maxime Crochemore; Costas S. Iliopoulos; Pierre Peterlongo (LATA, 2007)

Weighted Degenerated Approximate Pattern Matching. - Costas S. Iliopoulos; Inuka Jayasekera; Borivoj Melichar; Jan Supol (LATA, 2007)

Finding Patterns in Given Intervals. - Maxime Crochemore; Costas S. Iliopoulos; M. Sohel Rahman (MFCS, 2007)

Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. - Inbok Lee; Costas S. Iliopoulos; Syng-Yup Ohn (RSFDGrC, 2007)

Pattern Matching Algorithms with Don't Cares. - M. Sohel Rahman; Costas S. Iliopoulos (SOFSEM (2), 2007)

Local Transpositions in Alignment of Polyphonic Musical Sequences. - Julien Allali; Pascal Ferraro; Pierre Hanna; Costas S. Iliopoulos (SPIRE, 2007)

Pattern Matching in Degenerate DNA/RNA Sequences. - M. Sohel Rahman; Costas S. Iliopoulos; Laurent Mouchard (WALCOM, 2007)

The Constrained Longest Common Subsequence Problem for Degenerate Strings. - Costas S. Iliopoulos; M. Sohel Rahman; Michal Vorácek; Ladislav Vagner (CIAA, 2007)

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. - A. Bakalis; Costas S. Iliopoulos; Christos Makris 001; Spyros Sioutas; Evangelos Theodoridis; Athanasios K. Tsakalidis; Kostas Tsichlas (Comput. J., 2007)

All maximal-pairs in step-leap representation of melodic sequence. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Manal Mohamed 001; Marie-France Sagot (Inf. Sci., 2007)

Computing the lambda-covers of a string. - Qing Guo 002; Hui Zhang 004; Costas S. Iliopoulos (Inf. Sci., 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)

Algorithms for extracting motifs from biological weighted sequences. - Costas S. Iliopoulos; Katerina Perdikuri; Evangelos Theodoridis; Athanasios K. Tsakalidis; Kostas Tsichlas (J. Discrete Algorithms, 2007)

Linear time algorithm for the longest common repeat problem. - Inbok Lee; Costas S. Iliopoulos; Kunsoo Park (J. Discrete Algorithms, 2007)

Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. - Pavlos Antoniou; Costas S. Iliopoulos; Inuka Jayasekera; M. Sohel Rahman (BIRD, 2008)

Indexing Factors in DNA/RNA Sequences. - Tomás Flouri; Costas S. Iliopoulos; Mohammad Sohel Rahman; Ladislav Vagner; Michal Vorácek (BIRD, 2008)

Bounds on Powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Developments in Language Theory, 2008)

A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. - Costas S. Iliopoulos; M. Sohel Rahman (SOFSEM, 2008)

Improved Algorithms for the Range Next Value Problem and Applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Mohammad Sohel Rahman; Tomasz Walen (STACS, 2008)

Conservative String Covering of Indeterminate Strings. - Pavlos Antoniou; Maxime Crochemore; Costas S. Iliopoulos; Inuka Jayasekera; Gad M. Landau (Stringology, 2008)

Indexing Circular Patterns. - Costas S. Iliopoulos; M. Sohel Rahman (WALCOM, 2008)

External Memory Algorithms for String Problems. - Kangho Roh; Maxime Crochemore; Costas S. Iliopoulos; Kunsoo Park (Fundam. Informaticae, 2008)

Algorithms for Computing the lambda-regularities in Strings. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (Fundam. Informaticae, 2008)

Generalized approximate regularities in strings. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (Int. J. Comput. Math., 2008)

Identifying Rhythms in Musical Texts. - Manolis Christodoulakis; Costas S. Iliopoulos; Mohammad Sohel Rahman; William F. Smyth (Int. J. Found. Comput. Sci., 2008)

Optimal prefix and suffix queries on texts. - Maxime Crochemore; Costas S. Iliopoulos; Mohammad Sohel Rahman (Inf. Process. Lett., 2008)

Faster index for property matching. - Costas S. Iliopoulos; Mohammad Sohel Rahman (Inf. Process. Lett., 2008)

New efficient algorithms for the LCS and constrained LCS problems. - Costas S. Iliopoulos; Mohammad Sohel Rahman (Inf. Process. Lett., 2008)

Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. - Costas S. Iliopoulos; Mirka Miller (J. Discrete Algorithms, 2008)

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching. - Costas S. Iliopoulos; Laurent Mouchard; Mohammad Sohel Rahman (Math. Comput. Sci., 2008)

Property matching and weighted matching. - Amihood Amir; Eran Chencinski; Costas S. Iliopoulos; Tsvi Kopelowitz; Hui Zhang 004 (Theor. Comput. Sci., 2008)

Algorithms for computing variants of the longest common subsequence problem. - Costas S. Iliopoulos; M. Sohel Rahman (Theor. Comput. Sci., 2008)

Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (IJCBS, 2009)

LPF Computation Revisited. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (IWOCA, 2009)

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. - Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (PARCO, 2009)

Validation and Decomposition of Partially Occluded Images with Holes. - Julien Allali; Pavlos Antoniou; Costas S. Iliopoulos; Pascal Ferraro; Manal Mohamed 001 (Stringology, 2009)

Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. - Costas S. Iliopoulos; Mirka Miller; Solon P. Pissis (Stringology, 2009)

Indexing Factors with Gaps. - Costas S. Iliopoulos; M. Sohel Rahman (Algorithmica, 2009)

On the maximal number of highly periodic runs in a string - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2009)

Toward a General Framework for Polyphonic Comparison. - Julien Allali; Pascal Ferraro; Pierre Hanna; Costas S. Iliopoulos; Matthias Robine (Fundam. Informaticae, 2009)

Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. - Costas S. Iliopoulos; William F. Smyth; Munina Yusufu (Fundam. Informaticae, 2009)

Algorithms for mapping short degenerate and weighted sequences to a reference genome. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 2009)

A New Efficient Algorithm for Computing the Longest Common Subsequence. - Costas S. Iliopoulos; Mohammad Sohel Rahman (Theory Comput. Syst., 2009)

Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. - Costas S. Iliopoulos; Wojciech Rytter (Theor. Comput. Sci., 2009)

Varieties of Regularities in Weighted Sequences. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (AAIM, 2010)

REAL: an efficient REad ALigner for next generation sequencing reads. - Kimon Frousios; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis; German Tischler (BCB, 2010)

An algorithm for mapping short reads to a dynamically changing genomic sequence. - Tomás Flouri; Jan Holub 001; Costas S. Iliopoulos; Solon P. Pissis (BIBM, 2010)

Combinatorial Detection of Arrhythmia. - Julien Allali; Pascal Ferraro; Costas S. Iliopoulos; Spiros Michalakopoulos (BIOSIGNALS, 2010)

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis (Algorithms and Applications, 2010)

An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (CIAC, 2010)

Algorithms for Three Versions of the Shortest Common Superstring Problem. - Maxime Crochemore; Marek Cygan; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2010)

Cover Array String Reconstruction. - Maxime Crochemore; Costas S. Iliopoulos; Solon P. Pissis; German Tischler (CPM, 2010)

Music Genre Classification via Compressive Sampling. - Kaichun K. Chang; Jyh-Shing Roger Jang; Costas S. Iliopoulos (ISMIR, 2010)

On the Maximal Number of Cubic Runs in a String. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (LATA, 2010)

Combinatorial ECG analysis for mobile devices. - Costas S. Iliopoulos; Spiros Michalakopoulos (Multimedia Information Retrieval, 2010)

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (SOFSEM, 2010)

Extracting Powers and Periods in a String from Its Runs Structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2010)

A Note on a priori Estimations of Classification Circuit Complexity. - Andreas Alexander Albrecht; Alexander V. Chaskin; Costas S. Iliopoulos; Oktay M. Kasim-Zade; Georgios Lappas; Kathleen Steinhöfel (Fundam. Informaticae, 2010)

Finding Patterns In Given Intervals. - Maxime Crochemore; Marcin Kubica 001; Tomasz Walen; Costas S. Iliopoulos; M. Sohel Rahman (Fundam. Informaticae, 2010)

Number of Occurrences of powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Int. J. Found. Comput. Sci., 2010)

Finite automata based algorithms on subsequences and supersequences of degenerate strings. - Costas S. Iliopoulos; M. Sohel Rahman; Michal Vorácek; Ladislav Vagner (J. Discrete Algorithms, 2010)

Foreword. - Manolis Christodoulakis; Costas S. Iliopoulos (Math. Comput. Sci., 2010)

DynMap: mapping short reads to multiple related genomes. - Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (BCB, 2011)

Approximate string-matching with a single gap for sequence alignment. - Tomás Flouri; Kunsoo Park; Kimon Frousios; Solon P. Pissis; Costas S. Iliopoulos; German Tischler (BCB, 2011)

On the Right-Seed Array of a String. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (COCOON, 2011)

Efficient Seeds Computation Revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (CPM, 2011)

Tree Indexing by Pushdown Automata and Repeats of Subtrees. - Tomás Flouri; Jan Janousek; Borivoj Melichar; Costas S. Iliopoulos; Solon P. Pissis (FedCSIS, 2011)

Computing All Subtree Repeats in Ordered Ranked Trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (SPIRE, 2011)

New complexity results for the k-covers problem. - Costas S. Iliopoulos; Manal Mohamed 001; William F. Smyth (Inf. Sci., 2011)

Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. - Oudone Phanalasy; Mirka Miller; Costas S. Iliopoulos; Solon P. Pissis; Elaheh Vaezpour (Math. Comput. Sci., 2011)

On the repetitive collection indexing problem. - Ali Alatabbi; Carl Barton; Costas S. Iliopoulos (BIBM Workshops, 2012)

The Maximum Number of Squares in a Tree. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (CPM, 2012)

Overlapping repetitions in weighted sequence. - Ali Alatabbi; Maxime Crochemore; Costas S. Iliopoulos; Tewogboye A. Okanlawon (CUBE, 2012)

Detection of fixed length web spambot using REAL (read aligner). - Mourad Elloumi; Pedram Hayati; Costas S. Iliopoulos; Solon P. Pissis; Arfaat Shah (CUBE, 2012)

Locating Tandem Repeats in Weighted Biological Sequences. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (ICIC (3), 2012)

Computing the Minimum λ-Cover in Weighted Sequences. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (ICIC (1), 2012)

Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations. - Ali Alatabbi; Carl Barton; Costas S. Iliopoulos; Laurent Mouchard (AIAI (2), 2012)

Melodic String Matching via Interval Consolidation and Fragmentation. - Carl Barton; Emilios Cambouropoulos; Costas S. Iliopoulos; Zsuzsanna Lipták (AIAI (2), 2012)

Conceptualization and Significance Study of a New Appliation CS-MIR. - Kaichun K. Chang; Carl Barton; Costas S. Iliopoulos; Jyh-Shing Roger Jang (AIAI (1), 2012)

GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. - Tomás Flouri; Costas S. Iliopoulos; Kunsoo Park; Solon P. Pissis (AIAI (2), 2012)

New and Efficient Approaches to the Quasiperiodic Characterisation of a String. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; William F. Smyth; Wojciech Tyczynski (Stringology, 2012)

Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Int. J. Found. Comput. Sci., 2012)

Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. - Costas S. Iliopoulos; Mirka Miller; Solon P. Pissis (Int. J. Found. Comput. Sci., 2012)

Computing all subtree repeats in ordered trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (Inf. Process. Lett., 2012)

The maximal number of cubic runs in a word. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comput. Syst. Sci., 2012)

On left and right seeds of a string. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (J. Discrete Algorithms, 2012)

Efficient algorithms for three variants of the LPF table. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (J. Discrete Algorithms, 2012)

Tree template matching in ranked ordered trees by pushdown automata. - Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (J. Discrete Algorithms, 2012)

An algorithm for mapping short reads to a dynamically changing genomic sequence. - Costas S. Iliopoulos; Derrick G. Kourie; Laurent Mouchard; Themba K. Musombuka; Solon P. Pissis; Corné de Ridder (J. Discrete Algorithms, 2012)

Editorial. - Costas S. Iliopoulos; William F. Smyth (J. Discrete Algorithms, 2012)

Exact and approximate rhythm matching algorithms. - Joseph Wun-Tat Chan; Costas S. Iliopoulos; Spiros Michalakopoulos; M. Sohel Rahman (Int. J. Digit. Libr., 2012)

Improved algorithms for the range next value problem and applications. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; M. Sohel Rahman; German Tischler; Tomasz Walen (Theor. Comput. Sci., 2012)

GapsMis: flexible sequence alignment with a bounded number of gaps. - Carl Barton; Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (BCB, 2013)

Generic Algorithms for Factoring Strings. - David E. Daykin; Jacqueline W. Daykin; Costas S. Iliopoulos; W. F. Smyth (Information Theory, Combinatorics, and Search Theory, 2013)

Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences. - Carl Barton; Costas S. Iliopoulos; Nicola J. Mulder; Bruce W. Watson (EANN (2), 2013)

Suffix Tree of Alignment: An Efficient Index for Similar Data. - Joong Chae Na; Heejin Park; Maxime Crochemore; Jan Holub 001; Costas S. Iliopoulos; Laurent Mouchard; Kunsoo Park (IWOCA, 2013)

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2013)

Maximal Palindromic Factorization. - Ali Alatabbi; Costas S. Iliopoulos; Mohammad Sohel Rahman (Stringology, 2013)

Overlapping factors in words. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Australas. J Comb., 2013)

Locating tandem repeats in weighted sequences in proteins. - Hui Zhang 004; Qing Guo 002; Costas S. Iliopoulos (BMC Bioinform., 2013)

Order-Preserving Suffix Trees and Their Algorithmic Applications - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CoRR, 2013)

Computing the Longest Previous Factor. - Maxime Crochemore; Lucian Ilie; Costas S. Iliopoulos; Marcin Kubica 001; Wojciech Rytter; Tomasz Walen (Eur. J. Comb., 2013)

Bipartite Ramsey numbers involving stars, stripes and trees. - Michalis Christou; Costas S. Iliopoulos; Mirka Miller (Electron. J. Graph Theory Appl., 2013)

Querying highly similar sequences. - Carl Barton; Mathieu Giraud; Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 2013)

A note on efficient computation of all Abelian periods in a string. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Jakub Pachocki; Jakub Radoszewski; Wojciech Rytter; Wojciech Tyczynski; Tomasz Walen (Inf. Process. Lett., 2013)

Tree template matching in unranked ordered trees. - Michalis Christou; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis; Jan Zdárek (J. Discrete Algorithms, 2013)

Efficient seed computation revisited. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (Theor. Comput. Sci., 2013)

Enhanced string covering. - Tomás Flouri; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Simon J. Puglisi; W. F. Smyth; Wojciech Tyczynski (Theor. Comput. Sci., 2013)

A fast and lightweight filter-based algorithm for circular pattern matching. - Md. Aashikur Rahman Azim; Costas S. Iliopoulos; Mohammad Sohel Rahman; M. Samiruzzaman (BCB, 2014)

Detection of Web Spambot in the Presence of Decoy Actions. - Vida Ghanaei; Costas S. Iliopoulos; Solon P. Pissis (BDCloud, 2014)

On-line Minimum Closed Covers. - Costas S. Iliopoulos; Manal Mohamed 001 (AIAI (Workshops), 2014)

Evaluation of credibility assessment for microblogging: models and future directions. - Amal Abdullah AlMansour; Ljiljana Brankovic; Costas S. Iliopoulos (I-KNOW, 2014)

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis; William F. Smyth (IWOCA, 2014)

Fast algorithms for approximate circular string matching. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (Algorithms Mol. Biol., 2014)

Optimal computation of all tandem repeats in a weighted sequence. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (Algorithms Mol. Biol., 2014)

On the Average-case Complexity of Pattern Matching with Wildcards. - Carl Barton; Costas S. Iliopoulos (CoRR, 2014)

Abelian borders in binary words. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Discret. Appl. Math., 2014)

New simple efficient algorithms computing powers and runs in strings. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Krzysztof Stencel; Tomasz Walen (Discret. Appl. Math., 2014)

The swap matching problem revisited. - Pritom Ahmed; Costas S. Iliopoulos; A. S. M. Sohidull Islam; Mohammad Sohel Rahman (Theor. Comput. Sci., 2014)

Extending alignments with k-mismatches and ℓ-gaps. - Carl Barton; Costas S. Iliopoulos; Inbok Lee; Laurent Mouchard; Kunsoo Park; Solon P. Pissis (Theor. Comput. Sci., 2014)

On the average number of regularities in a word. - Manolis Christodoulakis; Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Theor. Comput. Sci., 2014)

Extracting powers and periods in a word from its runs structure. - Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica 001; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2014)

Order-preserving matching. - Jinil Kim; Peter Eades; Rudolf Fleischer; Seok-Hee Hong 001; Costas S. Iliopoulos; Kunsoo Park; Simon J. Puglisi; Takeshi Tokuyama (Theor. Comput. Sci., 2014)

Using Arabic Microblogs Features in Determining Credibility. - Amal Abdullah AlMansour; Costas S. Iliopoulos (ASONAM, 2015)

A Filter-Based Approach for Approximate Circular Pattern Matching. - Md. Aashikur Rahman Azim; Costas S. Iliopoulos; M. Sohel Rahman; M. Samiruzzaman (ISBRA, 2015)

SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching. - Ali Alatabbi; Shuhana Azmin; Md. Kawser Habib; Costas S. Iliopoulos; M. Sohel Rahman (IWBBIO (2), 2015)

Average-Case Optimal Approximate Circular String Matching. - Carl Barton; Costas S. Iliopoulos; Solon P. Pissis (LATA, 2015)

Circular Sequence Comparison with q-grams. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (WABI, 2015)

Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. - Carl Barton; Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis; Ahmad Retha; Fatima Vayani (SEA, 2015)

Linear-Time Superbubble Identification Algorithm. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (CoRR, 2015)

A note on the longest common compatible prefix problem for partial words. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Jakub Radoszewski; Wojciech Rytter; Bartosz Szreder; Tomasz Walen (J. Discrete Algorithms, 2015)

Antimagicness of Generalized Corona and Snowflake Graphs. - Jacqueline W. Daykin; Costas S. Iliopoulos; Mirka Miller; Oudone Phanalasy (Math. Comput. Sci., 2015)

Global and local sequence alignment with a bounded number of gaps. - Carl Barton; Tomás Flouri; Costas S. Iliopoulos; Solon P. Pissis (Theor. Comput. Sci., 2015)

Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. - Costas S. Iliopoulos; Jakub Radoszewski (CPM, 2016)

Efficient Computation of Clustered-Clumps in Degenerate Strings. - Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001 (AIAI, 2016)

Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order. - Oluwole I. Ajala; Moudhi Aljamea; Mai Alzamel; Costas S. Iliopoulos (IntelliSys (2), 2016)

Effective Solutions for Most Common Vulnerabilities in Web Applications. - Moudhi M. Aljamea; Costas S. Iliopoulos; M. Samiruzzaman (IntelliSys (2), 2016)

Smart Meter Data Analysis. - Moudhi M. Aljamea; Ljiljana Brankovic; Jia Gao 001; Costas S. Iliopoulos; M. Samiruzzaman (ICC 2016, 2016)

Detection Of URL In Image Steganography. - Moudhi M. Aljamea; Costas S. Iliopoulos; M. Samiruzzaman (ICC 2016, 2016)

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (SPIRE, 2016)

Optimal Computation of Avoided Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2016)

Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. - Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Fatima Vayani (WALCOM, 2016)

Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

Erratum to: Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

Quasiperiodicities in Fibonacci strings. - Michalis Christou; Maxime Crochemore; Costas S. Iliopoulos (Ars Comb., 2016)

Closed factorization. - Golnaz Badkobeh; Hideo Bannai; Keisuke Goto 001; Tomohiro I; Costas S. Iliopoulos; Shunsuke Inenaga; Simon J. Puglisi; Shiho Sugimoto (Discret. Appl. Math., 2016)

Linear algorithm for conservative degenerate pattern matching. - Maxime Crochemore; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Fatima Vayani (Eng. Appl. Artif. Intell., 2016)

Algorithms for Longest Common Abelian Factors. - Ali Alatabbi; Costas S. Iliopoulos; Alessio Langiu; M. Sohel Rahman (Int. J. Found. Comput. Sci., 2016)

Linear-time superbubble identification algorithm for genome assembly. - Ljiljana Brankovic; Costas S. Iliopoulos; Ritu Kundu; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (Theor. Comput. Sci., 2016)

Order-preserving indexing. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Marcin Kubica 001; Alessio Langiu; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2016)

Foreword. - Costas S. Iliopoulos; Simon J. Puglisi (Theor. Comput. Sci., 2016)

Searching and Indexing Circular Patterns. - Costas S. Iliopoulos; Solon P. Pissis; M. Sohel Rahman (Algorithms for Next-Generation Sequencing Data, 2017)

On-Line Pattern Matching on Similar Texts. - Roberto Grossi; Costas S. Iliopoulos; Chang Liu 035; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Giovanna Rosone; Fatima Vayani; Luca Versari (CPM, 2017)

Palindromic Decompositions with Gaps and Errors. - Michal Adamczyk; Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Jakub Radoszewski (CSR, 2017)

Efficient Computation of Palindromes in Sequences with Uncertainties. - Mai Alzamel; Jia Gao 001; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (EANN, 2017)

Identification of Fingerprints using Circular String Approximation for Mobile Devices. - Oluwole I. Ajala; Costas S. Iliopoulos; Mujibur R. Khan (FedCSIS (Communication Papers), 2017)

How to Answer a Small Batch of RMQs or LCA Queries in Practice. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (IWOCA, 2017)

Recent Advances of Palindromic Factorization. - Mai Alzamel; Costas S. Iliopoulos (IWOCA, 2017)

Efficient Pattern Matching in Elastic-Degenerate Texts. - Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis (LATA, 2017)

Longest Common Factor After One Edit Operation. - Amihood Amir; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (SPIRE, 2017)

Optimal Computation of Overabundant Words. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (WABI, 2017)

On avoided words, absent words, and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Algorithms Mol. Biol., 2017)

Two strings at Hamming distance 1 cannot be both quasiperiodic. - Amihood Amir; Costas S. Iliopoulos; Jakub Radoszewski (Inf. Process. Lett., 2017)

Foreword. - Costas S. Iliopoulos; Alessio Langiu (Math. Comput. Sci., 2017)

Fast circular dictionary-matching algorithm. - Tanver Athar; Carl Barton; Widmer Bland; Jia Gao 001; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (Math. Struct. Comput. Sci., 2017)

The longest common substring problem. - Maxime Crochemore; Costas S. Iliopoulos; Alessio Langiu; Filippo Mignosi (Math. Struct. Comput. Sci., 2017)

Covering problems for partial words and for indeterminate strings. - Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (Theor. Comput. Sci., 2017)

Linear-Time Algorithm for Long LCF with k Mismatches. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (CPM, 2018)

Towards String Sanitization. - Oluwole I. Ajala; Hayam Alamro; Costas S. Iliopoulos; Grigorios Loukides (AIAI (Workshops), 2018)

How Much Different Are Two Words with Different Shortest Periods. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Ritu Kundu; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (AIAI (Workshops), 2018)

Efficient Recognition of Abelian Palindromic Factors and Associated Results. - Costas S. Iliopoulos; Steven Watts (AIAI (Workshops), 2018)

Property Suffix Array with Applications. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (LATIN, 2018)

Longest Common Prefixes with k-Mismatches and Applications. - Hayam Alamro; Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SOFSEM, 2018)

Efficient Computation of Sequence Mappability. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (SPIRE, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Carl Barton; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (SPIRE, 2018)

Longest Property-Preserved Common Factor. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (SPIRE, 2018)

Maximal Motif Discovery in a Sliding Window. - Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Fatima Vayani (SPIRE, 2018)

Degenerate String Comparison and Applications. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (WABI, 2018)

Longest Common Prefixes with k-Errors and Applications. - Lorraine A. K. Ayad; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis (CoRR, 2018)

Efficient Computation of Palindromes in Sequences with Uncertainties. - Mai Alzamel; Jia Gao 001; Costas S. Iliopoulos; Chang Liu 035 (Fundam. Informaticae, 2018)

Preface. - Costas S. Iliopoulos; Fatima Vayani (Int. J. Found. Comput. Sci., 2018)

Computing the Antiperiod(s) of a String. - Hayam Alamro; Golnaz Badkobeh; Djamal Belazzougui; Costas S. Iliopoulos; Simon J. Puglisi (CPM, 2019)

Quasi-Linear-Time Algorithm for Longest Common Circular Factor. - Mai Alzamel; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2019)

On the Cyclic Regularities of Strings. - Oluwole I. Ajala; Miznah Alshammary; Mai Alzamel; Jia Gao 001; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Bruce W. Watson (AIAI (Workshops), 2019)

A Brief Overview of Dead-Zone Pattern Matching Algorithms. - Miznah Alshammary; Mai Alzamel; Costas S. Iliopoulos; Richard E. Watson; Bruce W. Watson (AIAI (Workshops), 2019)

Online Algorithms on Antipowers and Antiperiods. - Mai Alzamel; Alessio Conte; Daniele Greco; Veronica Guerrini; Costas S. Iliopoulos; Nadia Pisanti; Nicola Prezza; Giulia Punzi; Giovanna Rosone (SPIRE, 2019)

On-line weighted pattern matching. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski (Inf. Comput., 2019)

Efficient enumeration of non-equivalent squares in partial words with few holes. - Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen (J. Comb. Optim., 2019)

On overabundant words and their application to biological sequence analysis. - Yannis Almirantis; Panagiotis Charalampopoulos; Jia Gao 001; Costas S. Iliopoulos; Manal Mohamed 001; Solon P. Pissis; Dimitris Polychronopoulos (Theor. Comput. Sci., 2019)

Off-line and on-line algorithms for closed string factorization. - Mai Alzamel; Costas S. Iliopoulos; W. F. Smyth; Wing-Kin Sung (Theor. Comput. Sci., 2019)

Efficiently Detecting Web Spambots in a Temporally Annotated Sequence. - Hayam Alamro; Costas S. Iliopoulos; Grigorios Loukides (AINA, 2020)

Finding the Anticover of a String. - Mai Alzamel; Alessio Conte; Shuhei Denzumi; Roberto Grossi; Costas S. Iliopoulos; Kazuhiro Kurita; Kunihiro Wasa (CPM, 2020)

Detecting Pattern Efficiently with Don't Cares. - Hayam Alamro; Costas S. Iliopoulos (EANN, 2020)

Fingerprints Recognition System-Based on Mobile Device Identification Using Circular String Pattern Matching Techniques. - Miznah H. Alshammary; Costas S. Iliopoulos; Mujibur R. Khan (AIAI (Workshops), 2020)

Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window. - Miznah H. Alshammary; Costas S. Iliopoulos; Manal Mohamed 001; Fatima Vayani (AIAI (Workshops), 2020)

Internal Quasiperiod Queries. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (SPIRE, 2020)

GenMap: ultra-fast computation of genome mappability. - Christopher Pockrandt; Mai Alzamel; Costas S. Iliopoulos; Knut Reinert (Bioinform., 2020)

Comparing Degenerate Strings. - Mai Alzamel; Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Fundam. Informaticae, 2020)

Preface. - Mai Alzamel; Costas S. Iliopoulos (Inf. Comput., 2020)

Efficient Identification of k-Closed Strings. - Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Wing-Kin Sung; Steven Watts (Int. J. Found. Comput. Sci., 2020)

Property Suffix Array with Applications in Indexing Weighted Sequences. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Chang Liu 035; Solon P. Pissis (ACM J. Exp. Algorithmics, 2020)

Faster algorithms for 1-mappability of a sequence. - Mai Alzamel; Panagiotis Charalampopoulos; Costas S. Iliopoulos; Solon P. Pissis; Jakub Radoszewski; Wing-Kin Sung (Theor. Comput. Sci., 2020)

Longest property-preserved common factor: A new string-processing framework. - Lorraine A. K. Ayad; Giulia Bernardini 001; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone (Theor. Comput. Sci., 2020)

IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. - Hayam Alamro; Mai Alzamel; Costas S. Iliopoulos; Solon P. Pissis; Steven Watts (BMC Bioinform., 2021)

Efficient pattern matching in elastic-degenerate strings. - Costas S. Iliopoulos; Ritu Kundu; Solon P. Pissis (Inf. Comput., 2021)

Shortest covers of all cyclic shifts of a string. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (Theor. Comput. Sci., 2021)

Linear-Time Computation of Shortest Covers of All Rotations of a String. - Maxime Crochemore; Costas S. Iliopoulos; Jakub Radoszewski; Wojciech Rytter; Juliusz Straszynski; Tomasz Walen; Wiktor Zuba (CPM, 2022)

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). - Mai Alzamel; Costas S. Iliopoulos; Dimitrios Letsios; Nicola Prezza (Algorithmica, 2022)

Efficient Computation of Sequence Mappability. - Panagiotis Charalampopoulos; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Juliusz Straszynski (Algorithmica, 2022)

MUL-Tree Pruning for Consistency and Compatibility. - Christopher Hampson; Daniel J. Harvey; Costas S. Iliopoulos; Jesper Jansson 001; Zara Lim; Wing-Kin Sung (CPM, 2023)

Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. - Costas S. Iliopoulos; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen; Wiktor Zuba (CPM, 2023)

Advanced Skin Cancer Detection Using Deep Learning. - Mai Alzamel; Seba Alhejaili; Fatimah Alhumaidhi; Joud Alismail; Lama Almubarak; Halah Altammami; Costas S. Iliopoulos; Zara Lim (EANN, 2023)

Local Maximal Equality-Free Periodicities. - Mai Alzamel; Jacqueline W. Daykin; Christopher Hampson; Costas S. Iliopoulos; Zara Lim; W. F. Smyth (AIAI (Workshops), 2023)

Preface: MatBio 2021 Special Section. - Mai Alzamel; Christopher Hampson; Costas S. Iliopoulos; Fatima Vayani (J. Comput. Biol., 2023)

Maximal degenerate palindromes with gaps and mismatches. - Mai Alzamel; Christopher Hampson; Costas S. Iliopoulos; Zara Lim; Solon P. Pissis; Dimitrios Vlachakis; Steven Watts (Theor. Comput. Sci., 2023)

Pattern Matching in Polyphonic Musical Sequences. - Mai Alzamel; Costas S. Iliopoulos; Zara Lim; Marie Moser-Schwaiger (AIAI (4), 2024)

IRfold: An RNA Secondary Structure Prediction Approach. - David Hurst; Costas S. Iliopoulos; Zara Lim; Ionut Moraru (AIAI (1), 2024)

Deep learning approaches and data augmentation for melanoma detection. - Mai Alzamel; Costas S. Iliopoulos; Zara Lim (Neural Comput. Appl., 2025)

Finding the cyclic covers of a string. - Roberto Grossi; Costas S. Iliopoulos; Jesper Jansson 001; Zara Lim; Wing-Kin Sung; Wiktor Zuba (Inf. Process. Lett., 2026)