


Остановите войну!
for scientists:


default search action
Costas 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
- 2023
- [j151]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Fatima Vayani:
Preface: MatBio 2021 Special Section. J. Comput. Biol. 30(2): 117 (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]