default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCostas S. Iliopoulos
Person information
- affiliation: King's College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c169]David Hurst, Costas S. Iliopoulos
, Zara Lim, Ionut Moraru:
IRfold: An RNA Secondary Structure Prediction Approach. AIAI (1) 2024: 131-144- [c168]Mai Alzamel, Costas S. Iliopoulos, Zara Lim, Marie Moser-Schwaiger:
Pattern Matching in Polyphonic Musical Sequences. AIAI (4) 2024: 139-151 - 2023
- [j152]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani:
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30(2): 117 (2023) - [j151]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts:
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978: 114182 (2023) - [c167]Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung:
MUL-Tree Pruning for Consistency and Compatibility. CPM 2023: 14:1-14:18 - [c166]Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM 2023: 15:1-15:15 - [c165]Mai Alzamel, Seba Alhejaili, Fatimah Alhumaidhi, Joud Alismail, Lama Almubarak, Halah Altammami, Costas S. Iliopoulos, Zara Lim:
Advanced Skin Cancer Detection Using Deep Learning. EANN 2023: 267-278 - [c164]Mai Alzamel, Jacqueline W. Daykin, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, W. F. Smyth:
Local Maximal Equality-Free Periodicities. AIAI Workshops 2023: 359-368 - [c163]Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba:
Finding the Cyclic Covers of a String. WALCOM 2023: 139-150 - 2022
- [j150]Mai Alzamel, Costas S. Iliopoulos, Dimitrios Letsios, Nicola Prezza:
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW). Algorithmica 84(3): 565 (2022) - [j149]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - [c162]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM 2022: 22:1-22:15 - 2021
- [j148]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts:
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. BMC Bioinform. 22(1): 51 (2021) - [j147]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient pattern matching in elastic-degenerate strings. Inf. Comput. 279: 104616 (2021) - [j146]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866: 70-81 (2021) - 2020
- [j145]Christopher Pockrandt, Mai Alzamel, Costas S. Iliopoulos, Knut Reinert:
GenMap: ultra-fast computation of genome mappability. Bioinform. 36(12): 3687-3692 (2020) - [j144]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j143]Mai Alzamel, Costas S. Iliopoulos:
Preface. Inf. Comput. 270 (2020) - [j142]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts:
Efficient Identification of k-Closed Strings. Int. J. Found. Comput. Sci. 31(5): 595-610 (2020) - [j141]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications in Indexing Weighted Sequences. ACM J. Exp. Algorithmics 25: 1-16 (2020) - [j140]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [j139]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020) - [c161]Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides:
Efficiently Detecting Web Spambots in a Temporally Annotated Sequence. AINA 2020: 1007-1019 - [c160]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - [c159]Hayam Alamro, Costas S. Iliopoulos:
Detecting Pattern Efficiently with Don't Cares. EANN 2020: 447-459 - [c158]Miznah H. Alshammary, Costas S. Iliopoulos, Manal Mohamed, Fatima Vayani:
Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window. AIAI Workshops 2020: 213-224 - [c157]Miznah H. Alshammary, Costas S. Iliopoulos, Mujibur R. Khan:
Fingerprints Recognition System-Based on Mobile Device Identification Using Circular String Pattern Matching Techniques. AIAI Workshops 2020: 225-231 - [c156]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. SPIRE 2020: 60-75 - [c155]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest Covers of All Cyclic Shifts of a String. WALCOM 2020: 69-80 - [i31]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. CoRR abs/2007.13471 (2020)
2010 – 2019
- 2019
- [j138]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
On-line weighted pattern matching. Inf. Comput. 266: 49-59 (2019) - [j137]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j136]Mai Alzamel, Costas S. Iliopoulos, W. F. Smyth, Wing-Kin Sung:
Off-line and on-line algorithms for closed string factorization. Theor. Comput. Sci. 792: 12-19 (2019) - [j135]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792: 85-95 (2019) - [c154]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14 - [c153]Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi:
Computing the Antiperiod(s) of a String. CPM 2019: 32:1-32:11 - [c152]Miznah Alshammary, Mai Alzamel, Costas S. Iliopoulos, Richard E. Watson, Bruce W. Watson:
A Brief Overview of Dead-Zone Pattern Matching Algorithms. AIAI (Workshops) 2019: 208-218 - [c151]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the Cyclic Regularities of Strings. AIAI (Workshops) 2019: 219-224 - [c150]Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas S. Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi, Giovanna Rosone:
Online Algorithms on Antipowers and Antiperiods. SPIRE 2019: 175-188 - [i30]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR abs/1901.11305 (2019) - [i29]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the cyclic regularities of strings. CoRR abs/1908.01664 (2019) - 2018
- [j134]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu:
Efficient Computation of Palindromes in Sequences with Uncertainties. Fundam. Informaticae 163(3): 253-266 (2018) - [j133]Costas S. Iliopoulos, Fatima Vayani:
Preface. Int. J. Found. Comput. Sci. 29(8): 1247-1248 (2018) - [c149]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c148]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) 2018: 168-178 - [c147]Oluwole I. Ajala, Hayam Alamro, Costas S. Iliopoulos, Grigorios Loukides:
Towards String Sanitization. AIAI (Workshops) 2018: 200-210 - [c146]Costas S. Iliopoulos, Steven Watts:
Efficient Recognition of Abelian Palindromic Factors and Associated Results. AIAI (Workshops) 2018: 211-223 - [c145]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications. LATIN 2018: 290-302 - [c144]Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018: 636-649 - [c143]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c142]Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. SPIRE 2018: 27-41 - [c141]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c140]Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Maximal Motif Discovery in a Sliding Window. SPIRE 2018: 191-205 - [c139]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [e6]Costas S. Iliopoulos, Hon Wai Leong, Wing-Kin Sung:
Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings. Lecture Notes in Computer Science 10979, Springer 2018, ISBN 978-3-319-94666-5 [contents] - [i28]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. CoRR abs/1801.04425 (2018) - [i27]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - [i26]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i25]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018) - 2017
- [j132]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1): 5:1-5:12 (2017) - [j131]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128: 54-57 (2017) - [j130]Costas S. Iliopoulos, Alessio Langiu:
Foreword. Math. Comput. Sci. 11(2): 111-112 (2017) - [j129]Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Fast circular dictionary-matching algorithm. Math. Struct. Comput. Sci. 27(2): 143-156 (2017) - [j128]Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi:
The longest common substring problem. Math. Struct. Comput. Sci. 27(2): 277-295 (2017) - [j127]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698: 25-39 (2017) - [c138]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c137]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c136]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c135]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CSR 2017: 48-61 - [c134]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung:
Efficient Identification of k-Closed Strings. EANN 2017: 583-595 - [c133]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Efficient Computation of Palindromes in Sequences with Uncertainties. EANN 2017: 620-629 - [c132]Oluwole I. Ajala, Costas S. Iliopoulos, Mujibur R. Khan:
Identification of Fingerprints using Circular String Approximation for Mobile Devices. FedCSIS (Communication Papers) 2017: 193-197 - [c131]Mai Alzamel, Costas S. Iliopoulos:
Recent Advances of Palindromic Factorization. IWOCA 2017: 37-46 - [c130]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - [c129]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Texts. LATA 2017: 131-142 - [c128]Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c127]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. WABI 2017: 4:1-4:14 - [p1]Costas S. Iliopoulos, Solon P. Pissis, M. Sohel Rahman:
Searching and Indexing Circular Patterns. Algorithms for Next-Generation Sequencing Data 2017: 77-90 - [e5]Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman:
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. LIPIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-036-1 [contents] - [i24]Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. CoRR abs/1703.00195 (2017) - [i23]Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. CoRR abs/1703.08931 (2017) - [i22]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. CoRR abs/1705.03385 (2017) - [i21]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i20]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to answer a small batch of RMQs or LCA queries in practice. CoRR abs/1705.04589 (2017) - 2016
- [j126]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j125]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j124]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. Ars Comb. 129: 211-225 (2016) - [j123]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed factorization. Discret. Appl. Math. 212: 23-29 (2016) - [j122]Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51: 109-114 (2016) - [j121]Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman:
Algorithms for Longest Common Abelian Factors. Int. J. Found. Comput. Sci. 27(5): 529-544 (2016) - [j120]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609: 374-383 (2016) - [j119]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j118]Costas S. Iliopoulos, Simon J. Puglisi:
Foreword. Theor. Comput. Sci. 656: 107 (2016) - [c126]Costas S. Iliopoulos, Jakub Radoszewski:
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties. CPM 2016: 8:1-8:12 - [c125]Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed:
Efficient Computation of Clustered-Clumps in Degenerate Strings. AIAI 2016: 510-519 - [c124]Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman:
Effective Solutions for Most Common Vulnerabilities in Web Applications. IntelliSys (2) 2016: 738-754 - [c123]Oluwole I. Ajala, Moudhi Aljamea, Mai Alzamel, Costas S. Iliopoulos:
Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order. IntelliSys (2) 2016: 959-965 - [c122]Moudhi M. Aljamea, Ljiljana Brankovic, Jia Gao, Costas S. Iliopoulos, M. Samiruzzaman:
Smart Meter Data Analysis. ICC 2016 2016: 22:1-22:6 - [c121]Moudhi M. Aljamea, Costas S. Iliopoulos, M. Samiruzzaman:
Detection Of URL In Image Steganography. ICC 2016 2016: 23:1-23:6 - [c120]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [c119]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. WABI 2016: 1-13 - [c118]Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis. WALCOM 2016: 3-14 - [i19]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. CoRR abs/1604.08760 (2016) - [i18]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - [i17]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Strings. CoRR abs/1610.08111 (2016) - 2015
- [j117]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [j116]Jacqueline W. Daykin, Costas S. Iliopoulos, Mirka Miller, Oudone Phanalasy:
Antimagicness of Generalized Corona and Snowflake Graphs. Math. Comput. Sci. 9(1): 105-111 (2015) - [j115]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
Global and local sequence alignment with a bounded number of gaps. Theor. Comput. Sci. 582: 1-16 (2015) - [c117]Amal Abdullah AlMansour, Costas S. Iliopoulos:
Using Arabic Microblogs Features in Determining Credibility. ASONAM 2015: 1212-1219 - [c116]Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, M. Samiruzzaman:
A Filter-Based Approach for Approximate Circular Pattern Matching. ISBRA 2015: 24-35 - [c115]Ali Alatabbi, Shuhana Azmin, Md. Kawser Habib, Costas S. Iliopoulos, M. Sohel Rahman:
SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching. IWBBIO (2) 2015: 219-230 - [c114]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. LATA 2015: 85-96 - [c113]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - [c112]Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. SEA 2015: 247-258 - [e4]Costas S. Iliopoulos, Simon J. Puglisi, Emine Yilmaz:
String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings. Lecture Notes in Computer Science 9309, Springer 2015, ISBN 978-3-319-23825-8 [contents] - [i16]Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman:
Algorithms for Longest Common Abelian Factors. CoRR abs/1503.00049 (2015) - [i15]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-Time Superbubble Identification Algorithm. CoRR abs/1505.04019 (2015) - [i14]Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani:
Linear Algorithm for Conservative Degenerate Pattern Matching. CoRR abs/1506.04559 (2015) - 2014
- [j114]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9: 9 (2014) - [j113]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9: 21 (2014) - [j112]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163: 258-267 (2014) - [j111]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Abelian borders in binary words. Discret. Appl. Math. 171: 141-146 (2014) - [j110]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521: 29-41 (2014) - [j109]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
On the average number of regularities in a word. Theor. Comput. Sci. 525: 3-9 (2014) - [j108]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [j107]Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis:
Extending alignments with k-mismatches and ℓ-gaps. Theor. Comput. Sci. 525: 80-88 (2014) - [j106]Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam, Mohammad Sohel Rahman:
The swap matching problem revisited. Theor. Comput. Sci. 557: 34-49 (2014) - [c111]Md. Aashikur Rahman Azim, Costas S. Iliopoulos, Mohammad Sohel Rahman, M. Samiruzzaman:
A fast and lightweight filter-based algorithm for circular pattern matching. BCB 2014: 621-622 - [c110]Vida Ghanaei, Costas S. Iliopoulos, Solon P. Pissis:
Detection of Web Spambot in the Presence of Decoy Actions. BDCloud 2014: 277-279 - [c109]Costas S. Iliopoulos, Manal Mohamed:
On-line Minimum Closed Covers. AIAI Workshops 2014: 106-115 - [c108]Amal Abdullah AlMansour, Ljiljana Brankovic, Costas S. Iliopoulos:
Evaluation of credibility assessment for microblogging: models and future directions. I-KNOW 2014: 32:1-32:4 - [c107]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [c106]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth:
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. IWOCA 2014: 49-61 - [c105]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. Stringology 2014: 162-168 - [e3]Costas S. Iliopoulos, Alessio Langiu:
Proceedings of the 2nd International Conference on Algorithms for Big Data , Palermo, Italy, April 07-09, 2014. CEUR Workshop Proceedings 1146, CEUR-WS.org 2014 [contents] - [i13]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. CoRR abs/1406.5480 (2014) - [i12]Carl Barton, Costas S. Iliopoulos:
On the Average-case Complexity of Pattern Matching with Wildcards. CoRR abs/1407.0950 (2014) - [i11]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - 2013
- [j105]Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Overlapping factors in words. Australas. J Comb. 57: 49-64 (2013) - [j104]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Locating tandem repeats in weighted sequences in proteins. BMC Bioinform. 14(S-8): S2 (2013) - [j103]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - [j102]Michalis Christou, Costas S. Iliopoulos, Mirka Miller:
Bipartite Ramsey numbers involving stars, stripes and trees. Electron. J. Graph Theory Appl. 1(2): 89-99 (2013) - [j101]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis:
Querying highly similar sequences. Int. J. Comput. Biol. Drug Des. 6(1/2): 119-130 (2013) - [j100]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - [j99]Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek:
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20: 51-60 (2013) - [j98]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [j97]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. Theor. Comput. Sci. 506: 102-114 (2013) - [c104]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB 2013: 402 - [c103]David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth:
Generic Algorithms for Factoring Strings. Information Theory, Combinatorics, and Search Theory 2013: 402-418 - [c102]Carl Barton, Costas S. Iliopoulos, Nicola J. Mulder, Bruce W. Watson:
Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences. EANN (2) 2013: 11-19 - [c101]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA 2013: 337-348 - [c100]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [c99]Ali Alatabbi, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Maximal Palindromic Factorization. Stringology 2013: 70-77 - [i10]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order Preserving Matching. CoRR abs/1302.4064 (2013) - [i9]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i8]Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park:
Suffix Tree of Alignment: An Efficient Index for Similar Data. CoRR abs/1305.1744 (2013) - [i7]Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam, M. Sohel Rahman:
The Swap Matching Problem Revisited. CoRR abs/1309.1981 (2013) - [i6]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [j96]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. Int. J. Found. Comput. Sci. 23(2): 249-259 (2012) - [j95]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. Int. J. Found. Comput. Sci. 23(6): 1371-1384 (2012) - [j94]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j93]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78(6): 1828-1836 (2012) - [j92]Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder:
An algorithm for mapping short reads to a dynamically changing genomic sequence. J. Discrete Algorithms 10: 15-22 (2012) - [j91]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012) - [j90]Costas S. Iliopoulos, William F. Smyth:
Editorial. J. Discrete Algorithms 14: 1 (2012) - [j89]Costas S. Iliopoulos, William F. Smyth:
Editorial. J. Discrete Algorithms 16: 1 (2012) - [j88]Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012) - [j87]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. J. Discrete Algorithms 17: 31-44 (2012) - [j86]Joseph Wun-Tat Chan, Costas S. Iliopoulos, Spiros Michalakopoulos, M. Sohel Rahman:
Exact and approximate rhythm matching algorithms. Int. J. Digit. Libr. 12(2-3): 149-158 (2012) - [j85]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen:
Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434: 23-34 (2012) - [c98]Ali Alatabbi, Carl Barton, Costas S. Iliopoulos:
On the repetitive collection indexing problem. BIBM Workshops 2012: 682-687 - [c97]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. CPM 2012: 27-40 - [c96]Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon:
Overlapping repetitions in weighted sequence. CUBE 2012: 435-440 - [c95]Mourad Elloumi, Pedram Hayati, Costas S. Iliopoulos, Solon P. Pissis, Arfaat Shah:
Detection of fixed length web spambot using REAL (read aligner). CUBE 2012: 820-825 - [c94]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Locating Tandem Repeats in Weighted Biological Sequences. ICIC (3) 2012: 118-123 - [c93]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Computing the Minimum λ-Cover in Weighted Sequences. ICIC (1) 2012: 120-127 - [c92]Kaichun K. Chang, Carl Barton, Costas S. Iliopoulos, Jyh-Shing Roger Jang:
Conceptualization and Significance Study of a New Appliation CS-MIR. AIAI (1) 2012: 146-156 - [c91]Carl Barton, Emilios Cambouropoulos, Costas S. Iliopoulos, Zsuzsanna Lipták:
Melodic String Matching via Interval Consolidation and Fragmentation. AIAI (2) 2012: 460-469 - [c90]Ali Alatabbi, Carl Barton, Costas S. Iliopoulos, Laurent Mouchard:
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations. AIAI (2) 2012: 584-592 - [c89]Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis:
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) 2012: 593-601 - [c88]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski:
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology 2012: 75-88 - [i5]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Quasiperiodicities in Fibonacci strings. CoRR abs/1201.6162 (2012) - [i4]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos:
Identifying all abelian periods of a string in quadratic time and relevant problems. CoRR abs/1207.1307 (2012) - [i3]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012) - 2011
- [j84]Costas S. Iliopoulos, Manal Mohamed, William F. Smyth:
New complexity results for the k-covers problem. Inf. Sci. 181(12): 2571-2575 (2011) - [j83]Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour:
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Math. Comput. Sci. 5(1): 81-87 (2011) - [c87]Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
DynMap: mapping short reads to multiple related genomes. BCB 2011: 330-334 - [c86]Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler:
Approximate string-matching with a single gap for sequence alignment. BCB 2011: 490-492 - [c85]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On the Right-Seed Array of a String. COCOON 2011: 492-502 - [c84]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c83]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c82]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343 - [c81]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - [e2]Costas S. Iliopoulos, William F. Smyth:
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6460, Springer 2011, ISBN 978-3-642-19221-0 [contents] - [e1]Costas S. Iliopoulos, William F. Smyth:
Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7056, Springer 2011, ISBN 978-3-642-25010-1 [contents] - [i2]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011) - 2010
- [j82]Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman:
Finding Patterns In Given Intervals. Fundam. Informaticae 101(3): 173-186 (2010) - [j81]Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel:
A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Informaticae 104(3): 201-217 (2010) - [j80]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Number of Occurrences of powers in Strings. Int. J. Found. Comput. Sci. 21(4): 535-547 (2010) - [j79]Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner:
Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discrete Algorithms 8(2): 117-130 (2010) - [j78]Manolis Christodoulakis, Costas S. Iliopoulos:
Foreword. Math. Comput. Sci. 3(4): 371 (2010) - [c80]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Varieties of Regularities in Weighted Sequences. AAIM 2010: 271-280 - [c79]Kimon Frousios, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis, German Tischler:
REAL: an efficient REad ALigner for next generation sequencing reads. BCB 2010: 154-159 - [c78]Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis:
An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136 - [c77]Julien Allali, Pascal Ferraro, Costas S. Iliopoulos, Spiros Michalakopoulos:
Combinatorial Detection of Arrhythmia. BIOSIGNALS 2010: 180-187 - [c76]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis:
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. Algorithms and Applications 2010: 92-101 - [c75]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. CIAC 2010: 335-346 - [c74]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler:
Cover Array String Reconstruction. CPM 2010: 251-259 - [c73]Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309 - [c72]Kaichun K. Chang, Jyh-Shing Roger Jang, Costas S. Iliopoulos:
Music Genre Classification via Compressive Sampling. ISMIR 2010: 387-392 - [c71]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238 - [c70]Costas S. Iliopoulos, Spiros Michalakopoulos:
Combinatorial ECG analysis for mobile devices. Multimedia Information Retrieval 2010: 409-412 - [c69]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM 2010: 296-307 - [c68]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting Powers and Periods in a String from Its Runs Structure. SPIRE 2010: 258-269 - [c67]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149
2000 – 2009
- 2009
- [j77]Costas S. Iliopoulos, M. Sohel Rahman:
Indexing Factors with Gaps. Algorithmica 55(1): 60-70 (2009) - [j76]Costas S. Iliopoulos, William F. Smyth, Munina Yusufu:
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Fundam. Informaticae 97(3): 311-320 (2009) - [j75]Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos, Matthias Robine:
Toward a General Framework for Polyphonic Comparison. Fundam. Informaticae 97(3): 331-346 (2009) - [j74]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Algorithms for mapping short degenerate and weighted sequences to a reference genome. Int. J. Comput. Biol. Drug Des. 2(4): 385-397 (2009) - [j73]Costas S. Iliopoulos, Mohammad Sohel Rahman:
A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory Comput. Syst. 45(2): 355-371 (2009) - [j72]Costas S. Iliopoulos, Wojciech Rytter:
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. Theor. Comput. Sci. 410(43): 4293-4294 (2009) - [c66]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. IJCBS 2009: 174-180 - [c65]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. IWOCA 2009: 158-169 - [c64]Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. PARCO 2009: 150-157 - [c63]Julien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed:
Validation and Decomposition of Partially Occluded Images with Holes. Stringology 2009: 129-136 - [c62]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. Stringology 2009: 249-262 - [i1]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of highly periodic runs in a string. CoRR abs/0907.2157 (2009) - 2008
- [j71]Kangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park:
External Memory Algorithms for String Problems. Fundam. Informaticae 84(1): 17-32 (2008) - [j70]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Algorithms for Computing the lambda-regularities in Strings. Fundam. Informaticae 84(1): 33-49 (2008) - [j69]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
Generalized approximate regularities in strings. Int. J. Comput. Math. 85(2): 155-168 (2008) - [j68]Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth:
Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19(1): 37-51 (2008) - [j67]Costas S. Iliopoulos, Mohammad Sohel Rahman:
Faster index for property matching. Inf. Process. Lett. 105(6): 218-223 (2008) - [j66]Costas S. Iliopoulos, Mohammad Sohel Rahman:
New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett. 106(1): 13-18 (2008) - [j65]Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5): 320-325 (2008) - [j64]Costas S. Iliopoulos, Mirka Miller:
Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. J. Discrete Algorithms 6(1): 1-2 (2008) - [j63]Costas S. Iliopoulos, Laurent Mouchard, Mohammad Sohel Rahman:
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching. Math. Comput. Sci. 1(4): 557-569 (2008) - [j62]Costas S. Iliopoulos, M. Sohel Rahman:
Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci. 395(2-3): 255-267 (2008) - [j61]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008) - [c61]Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek:
Indexing Factors in DNA/RNA Sequences. BIRD 2008: 436-445 - [c60]Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman:
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. BIRD 2008: 446-455 - [c59]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Bounds on Powers in Strings. Developments in Language Theory 2008: 206-215 - [c58]Costas S. Iliopoulos, M. Sohel Rahman:
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. SOFSEM 2008: 316-327 - [c57]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen:
Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008: 205-216 - [c56]Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau:
Conservative String Covering of Indeterminate Strings. Stringology 2008: 108-115 - [c55]Costas S. Iliopoulos, M. Sohel Rahman:
Indexing Circular Patterns. WALCOM 2008: 46-57 - 2007
- [j60]A. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas:
Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. Comput. J. 50(2): 178-185 (2007) - [j59]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
All maximal-pairs in step-leap representation of melodic sequence. Inf. Sci. 177(9): 1954-1962 (2007) - [j58]Qing Guo, Hui Zhang, Costas S. Iliopoulos:
Computing the lambda-covers of a string. Inf. Sci. 177(19): 3957-3967 (2007) - [j57]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) - [j56]Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas:
Algorithms for extracting motifs from biological weighted sequences. J. Discrete Algorithms 5(2): 229-242 (2007) - [j55]Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear time algorithm for the longest common repeat problem. J. Discrete Algorithms 5(2): 243-249 (2007) - [c54]M. Sohel Rahman, Costas S. Iliopoulos:
A New Efficient Algorithm for Computing the Longest Common Subsequence. AAIM 2007: 82-90 - [c53]Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence. CPM 2007: 265-273 - [c52]Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo:
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. LATA 2007: 57-66 - [c51]Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol:
Weighted Degenerated Approximate Pattern Matching. LATA 2007: 285-296 - [c50]Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman:
Finding Patterns in Given Intervals. MFCS 2007: 645-656 - [c49]Inbok Lee, Costas S. Iliopoulos, Syng-Yup Ohn:
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. RSFDGrC 2007: 248-255 - [c48]M. Sohel Rahman, Costas S. Iliopoulos:
Pattern Matching Algorithms with Don't Cares. SOFSEM (2) 2007: 116-126 - [c47]M. Sohel Rahman, Costas S. Iliopoulos:
Indexing Factors with Gaps. SOFSEM (1) 2007: 465-474 - [c46]Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos:
Local Transpositions in Alignment of Polyphonic Musical Sequences. SPIRE 2007: 26-38 - [c45]M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard:
Pattern Matching in Degenerate DNA/RNA Sequences. WALCOM 2007: 109-120 - [c44]Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner:
The Constrained Longest Common Subsequence Problem for Degenerate Strings. CIAA 2007: 309-311 - 2006
- [j54]Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis:
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundam. Informaticae 71(2-3): 259-277 (2006) - [j53]Manolis Christodoulakis, Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis, Kostas Tsichlas:
Computation of Repetitions and Regularities of Biologically Weighted Sequences. J. Comput. Biol. 13(6): 1214-1231 (2006) - [j52]Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest repeats with a block of k don't cares. Theor. Comput. Sci. 362(1-3): 248-254 (2006) - [c43]Qing Guo, Hui Zhang, Costas S. Iliopoulos:
Computing the lambda-Seeds of a String. AAIM 2006: 303-313 - [c42]M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth:
Finding Patterns with Variable Length Gaps or Don't Cares. COCOON 2006: 146-155 - [c41]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property Matching and Weighted Matching. CPM 2006: 188-199 - [c40]Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat:
Approximate Matching in Weighted Sequences. CPM 2006: 365-376 - [c39]M. Sohel Rahman, Costas S. Iliopoulos:
Algorithms for Computing Variants of the Longest Common Subsequence Problem. ISAAC 2006: 399-408 - [c38]Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila:
Simple Algorithm for Sorting the Fibonacci String Rotations. SOFSEM 2006: 218-225 - [c37]Qing Guo, Hui Zhang, Costas S. Iliopoulos:
Computing the Minimum Approximate lambda-Cover of a String. SPIRE 2006: 49-60 - [c36]Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth:
Song classifications for dancing. Stringology 2006: 41-48 - [c35]Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77 - 2005
- [j51]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) - [j50]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. J. Autom. Lang. Comb. 10(5/6): 609-626 (2005) - [j49]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10(5/6): 641-653 (2005) - [j48]Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Biological Weighted Sequence. J. Autom. Lang. Comb. 10(5/6): 687-696 (2005) - [j47]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) - [j46]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Implementing approximate regularities. Math. Comput. Model. 42(7-8): 855-866 (2005) - [c34]Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems. CPM 2005: 68-78 - [c33]Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. ISMIR 2005: 167-174 - [c32]Jeremy Pickens, Costas S. Iliopoulos:
Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval. ISMIR 2005: 207-214 - [c31]Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed:
Approximation algorithm for the cyclic swap problem. Stringology 2005: 190-200 - 2004
- [b1]Costas S. Iliopoulos, Thierry Lecroq:
String Algorithmics. College Publications 2004, ISBN 978-1-904987-02-4 - [j45]Raphaël Clifford, Costas S. Iliopoulos:
Approximate string matching for music analysis. Soft Comput. 8(9): 597-603 (2004) - [c30]Hui Zhang, Qing Guo, Costas S. Iliopoulos:
String Matching with Swaps in a Weighted Sequence. CIS 2004: 698-704 - [c29]Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis:
Efficient Algorithms for Handling Molecular Weighted Sequences. IFIP TCS 2004: 265-278 - [c28]Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest Repeats with a Block of Don't Cares. LATIN 2004: 271-278 - [c27]Inbok Lee, Costas S. Iliopoulos, Kunsoo Park:
Linear Time Algorithm for the Longest Common Repeat Problem. SPIRE 2004: 10-17 - [c26]Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas:
Motif Extraction from Weighted Sequences. SPIRE 2004: 286-297 - [c25]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps. Stringology 2004: 88-97 - 2003
- [j44]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching. Fundam. Informaticae 56(1-2): 1-21 (2003) - [j43]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) - [j42]Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85(5): 227-233 (2003) - [j41]Diane M. Donovan, Costas S. Iliopoulos, Mirka Miller:
Editorial. J. Autom. Lang. Comb. 8(4): 555 (2003) - [j40]Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:
String Regularities with Don't Cares. Nord. J. Comput. 10(1): 40-51 (2003) - [j39]Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park:
Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3): 87-101 (2003) - [c24]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 - [c23]Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. Stringology 2003: 25-36 - [c22]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
Computing the Minimum k-Cover of a String. Stringology 2003: 51-64 - [c21]Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Weighted Sequence. Stringology 2003: 91-98 - 2002
- [j38]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) - [j37]Aspassia Daskalopulu, Costas S. Iliopoulos, Manal Mohamed:
On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. Int. J. Comput. Math. 79(12): 1245-1257 (2002) - [j36]Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas:
Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002) - [j35]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) - [c20]Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Identifying Occurrences of Maximal Pairs in Multiple Strings. CPM 2002: 133-143 - [c19]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - [c18]Costas S. Iliopoulos, Manal Mohamed:
Validation and Decomposition of Partially Occluded Images. SOFSEM 2002: 218-230 - [c17]Costas S. Iliopoulos, Masahiro Kurokawa:
String Matching with Gaps for Musical Melodic Recognition. Stringology 2002: 55-64 - [c16]Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis:
String Regularities with Don't Cares. Stringology 2002: 65-74 - 2001
- [j34]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Computing Evolutionary Chains in Musical Sequences. Electron. J. Comb. 8(2) (2001) - [j33]Costas S. Iliopoulos, James F. Reid:
Decomposition of Partially Occluded Strings in the Presence of Errors. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1129-1142 (2001) - [j32]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) - [j31]Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata. J. Autom. Lang. Comb. 6(2): 191-201 (2001) - [j30]Costas S. Iliopoulos, Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images. J. Autom. Lang. Comb. 6(3): 291-303 (2001) - [j29]Emilios Cambouropoulos, Tim Crawford, Costas S. Iliopoulos:
Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects. Comput. Humanit. 35(1): 9-21 (2001) - [j28]Tim Crawford, Costas S. Iliopoulos, Russel L. Winder, Haifeng Yu:
Approximate Musical Evolution. Comput. Humanit. 35(1): 55-64 (2001) - [j27]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001) - [c15]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE 2001: 59-67 - [c14]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón:
Approximate String Matching in Musical Sequences. Stringology 2001: 26-36 - [c13]Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzón:
The Max-Shift Algorithm for Approximate String Matching. WAE 2001: 13-25 - 2000
- [j26]Costas S. Iliopoulos, James F. Reid:
Optimal parallel analysis and decomposition of partially occluded strings. Parallel Comput. 26(4): 483-494 (2000) - [j25]Costas S. Iliopoulos:
Combinatorial Algorithms - Preface. Theor. Comput. Sci. 249(2): 241 (2000) - [c12]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Finding Motifs with Gaps. ISMIR 2000 - [c11]Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Fast Evolutionary Chains. SOFSEM 2000: 307-318 - [c10]Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón:
Computing Approximate Repetitions in Musical Sequences. Stringology 2000: 49-59
1990 – 1999
- 1999
- [j24]Costas S. Iliopoulos, Laurent Mouchard:
Quasiperiodicity: From Detection to Normal Forms. J. Autom. Lang. Comb. 4(3): 213-228 (1999) - [j23]Costas S. Iliopoulos, Laurent Mouchard:
Quasiperiodicity and String Covering. Theor. Comput. Sci. 218(1): 205-216 (1999) - [c9]Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate Periods of Strings. CPM 1999: 123-133 - 1998
- [j22]Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda:
Two-Dimensional Prefix String Matching and Covering on Square Matrices. Algorithmica 20(4): 353-373 (1998) - [c8]Costas S. Iliopoulos, Maureen Korda:
Massively Parallel Suffix Array Construction. SOFSEM 1998: 371-380 - [c7]Costas S. Iliopoulos, James F. Reid:
Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract). Stringology 1998: 83-94 - 1997
- [j21]Costas S. Iliopoulos, Dennis W. G. Moore, William F. Smyth:
A Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci. 172(1-2): 281-291 (1997) - 1996
- [j20]Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park:
Covering a String. Algorithmica 16(3): 288-297 (1996) - [j19]Clive N. Galley, Costas S. Iliopoulos:
On the lower bound for parallel string matching. Int. J. Comput. Math. 62(3-4): 155-162 (1996) - [j18]Clive N. Galley, Costas S. Iliopoulos:
A Pram Algorithm for a Special Case of the Set Partition Problem. Parallel Algorithms Appl. 10(1-2): 105-109 (1996) - [j17]Costas S. Iliopoulos, Maureen Korda:
Optimal Parallel Superprimitivity Testing for Square Arrays. Parallel Process. Lett. 6(3): 299-308 (1996) - [j16]Costas S. Iliopoulos, Kunsoo Park:
A Work-Time Optimal Algorithm for Computing All String Covers. Theor. Comput. Sci. 164(1&2): 299-310 (1996) - 1995
- [j15]Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123(1): 127-137 (1995) - [j14]Costas S. Iliopoulos, William F. Smyth:
A fast average case algorithm for lyndon decomposition. Int. J. Comput. Math. 57(1-2): 15-31 (1995) - 1994
- [j13]Clive N. Galley, Costas S. Iliopoulos:
A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Process. Lett. 4: 437-445 (1994) - [j12]Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth:
Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994) - [c6]Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. SODA 1994: 501-510 - 1993
- [c5]Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park:
Covering a String. CPM 1993: 54-62 - 1992
- [j11]Costas S. Iliopoulos, William F. Smyth:
Optimal Algorithms for Computing the canonical form of a circular string. Theor. Comput. Sci. 92(1): 87-105 (1992) - 1991
- [j10]Alberto Apostolico, Martin Farach, Costas S. Iliopoulos:
Optimal Superprimitivity Testing for Strings. Inf. Process. Lett. 39(1): 17-20 (1991)
1980 – 1989
- 1989
- [j9]Costas S. Iliopoulos:
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. SIAM J. Comput. 18(4): 658-669 (1989) - [j8]Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. SIAM J. Comput. 18(4): 670-678 (1989) - [c4]Costas S. Iliopoulos, William F. Smyth:
PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32 - 1988
- [j7]Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications. Algorithmica 3: 347-365 (1988) - [j6]Costas S. Iliopoulos:
On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. Theor. Comput. Sci. 56: 211-222 (1988) - 1987
- [c3]Alberto Apostolico, Costas S. Iliopoulos, Robert Paige:
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Algorithms and Architectures 1987: 70-76 - 1986
- [j5]Costas S. Iliopoulos:
Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem. Acta Informatica 23(6): 697-705 (1986) - 1985
- [j4]W. M. Beynon, Costas S. Iliopoulos:
Computing a Basis for a Finite Abelian p-Group. Inf. Process. Lett. 20(3): 161-163 (1985) - [j3]Costas S. Iliopoulos:
Analysis of Algorithms on Problems in General Abelian Groups. Inf. Process. Lett. 20(4): 215-220 (1985) - [j2]Costas S. Iliopoulos:
Computing in General Abelian Groups is Hard. Theor. Comput. Sci. 41: 81-93 (1985) - [c2]Costas S. Iliopoulos:
Gaussian Elimination over a Euclidean Ring. European Conference on Computer Algebra (2) 1985: 29-30 - [c1]Costas S. Iliopoulos:
Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups. European Conference on Computer Algebra (2) 1985: 225-228 - 1982
- [j1]Costas S. Iliopoulos:
Analysis of an Algorithm for Composition of Binary Quadratic Forms. J. Algorithms 3(2): 157-159 (1982)
Coauthor Index
Mai Abdulaziz Alzamel
aka: Mai Alzamel
aka: Mai Alzamel
[c162] [j146] [c156] [c155] [i31] [j137] [c154] [i30] [c149] [c148] [i27] [j128] [j127] [c137] [j124] [j122] [j119] [c120] [i18] [j117] [i14] [j112] [j111] [j110] [j109] [c107] [i11] [j105] [j103] [j100] [j98] [c101] [c100] [i9] [i8] [i6] [j95] [j94] [j93] [j91] [j87] [j85] [c97] [c96] [i5] [i4] [i3] [c85] [c84] [c82] [i2] [j82] [j80] [c76] [c74] [c73] [c71] [c69] [c68] [c67] [c65] [i1] [j71] [j65] [c59] [c57] [c56] [j59] [c52] [c50] [j52] [j47] [c33] [c28] [j44] [j43] [c24] [j38] [j36] [c19] [j34] [j32] [c15] [c14] [c12] [c11] [j22]
Yoan J. Pinzón
aka: Yoan José Pinzón Ardila
aka: Yoan José Pinzón Ardila
[j151] [j149] [j148] [j147] [j144] [j142] [j141] [j140] [j139] [j138] [j137] [j135] [c149] [c145] [c144] [c143] [c142] [c141] [c140] [c139] [i28] [i27] [i26] [i25] [j132] [j129] [c138] [c137] [c136] [c134] [c133] [c130] [c129] [c128] [c127] [p1] [e5] [i22] [i21] [i20] [j126] [j125] [j120] [j119] [c120] [c119] [i19] [i18] [i17] [j115] [c114] [c113] [c112] [i15] [j114] [j113] [j107] [c110] [c106] [i13] [j101] [j99] [j98] [j97] [c104] [c100] [i9] [j96] [j94] [j92] [j88] [j87] [c95] [c89] [c88] [j83] [c87] [c86] [c85] [c84] [c83] [c82] [c81] [i2] [c79] [c78] [c76] [c74] [j74] [c66] [c64] [c62]
[c166] [j149] [c162] [j146] [j140] [c156] [c155] [i31] [j138] [j137] [c154] [c151] [i30] [i29] [c149] [c148] [c143] [i27] [i26] [j131] [j127] [c138] [c137] [c135] [c128] [i24] [i23] [i21] [j119] [c126] [c120] [i18] [j117] [j112] [j110] [c107] [i11] [j100] [j98] [c100] [i9] [i6] [j93] [c97] [i3] [c84] [i2] [c73] [c71] [c68] [c67] [i1]
Mohammad Sohel Rahman
aka: M. Sohel Rahman
aka: M. Sohel Rahman
[c166] [c162] [j146] [c156] [c155] [i31] [j137] [c154] [c151] [i30] [i29] [c149] [c148] [i27] [j127] [c137] [j119] [c120] [i18] [j117] [j112] [j110] [c107] [i11] [j103] [j100] [j98] [c100] [i9] [i6] [j93] [j91] [c97] [i3] [c84] [i2] [c73] [c71] [c69] [c68] [c67] [j72] [c65] [i1] [j51] [c25] [j42] [j36] [c19]
William F. Smyth
aka: W. F. Smyth
aka: W. F. Smyth
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 2025-01-20 22:57 CET 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:
