Publications

2018
[385]O. Ajala, H. Alamro, C. Iliopoulos, G. Loukides, "Towards String Sanitization", in MHDW 2018 (accepted). [bibtex]
[384]C. Iliopoulos, S. Watts, "Efficient Recognition of Abelian Palindromic Factors and Associated Results", in MHDW 2018 (accepted). [bibtex]
[383]P. Charalampopoulos, M. Crochemore, C. Iliopoulos, T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Linear-Time Algorithm for Long LCF with k Mismatches", in CPM 2018 (accepted). [bibtex]
2017
[382]C. S. Iliopoulos, S. P. Pissis, S. J. Puglisi, R. Raman, "Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers", in 16th International Symposium on Experimental Algorithms (SEA 2017), Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]
[381]G. G. Ignazio Fontana, R. Rizzo, "Pelagic Species Identification by using a Probabilistic Neural Network and Echo-sounder Data", in ICANN (accepted), 2017. [bibtex]
[380]M. C. Panagiotis Charalampopoulos, T. Waleń, "Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes", in COCOON (accepted), 2017. [bibtex]
[379]Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos, "Optimal Computation of Overabundant Words", in WABI 2017 (accepted). [bibtex]
[378]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, J. Radoszewski, W. Rytter, T. Waleń, "Covering Problems for Partial Words and for Indeterminate Strings", Theoretical Computer Science, 2017. [bibtex]
[377]P. C. Amihood Amir, J. Radoszewski, "Longest common factor after one edit operation", in SPIRE 2017 (accepted). [bibtex]
[376]"Algorithms for Big Data", in Mathematics in Computer Science, C. S. Iliopoulos, A. Langiu, Eds., 2017. [bibtex]
[375]M. Alzamel, J. Gao, C. S. Iliopoulos, C. Liu, S. P. Pissis, "Efficient Computation of Palindromes in Sequences with Uncertainties", in Mining Humanistic Data Workshop (MHDW) (accepted), 2017. [bibtex]
[374]H. Alamro, M. Alzamel, C. S. Iliopoulos, S. P. Pissis, W. Sung, S. Watts, "Efficient identification of k-closed strings", in Mining Humanistic Data Workshop (MHDW) (accepted), 2017. [bibtex]
[373]C. S. Iliopoulos, R. Kundu and S. P. Pissis, "Efficient Pattern Matching in Elastic-Degenerate Texts", in Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings, F. Drewes, C. Martín-Vide, B. Truthe, Eds., Cham: Springer International Publishing, pp. 131-142. [bibtex] [pdf] [doi]
[372]M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "How to answer a small batch of RMQs or LCA queries in practice", in IWOCA 2017 (accepted). [bibtex] [pdf]
[371]A. Oluwole, C. S. Iliopoulos and M. R. Khan, "Identification of Fingerprints using Circular String Approximation for Mobile Devices", in 1st International Conference on Security, Privacy, and Trust (FedCSIS) (accepted), 2017. [bibtex]
[370]M. Adamczyk, M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, J. Radoszewski, "Palindromic Decompositions with Gaps and Errors", in CSR 2017, pp. 48-61. [bibtex] [pdf]
[369]R. Grossi, C. S. Iliopoulos, C. Liu, N. Pisanti, S. P. Pissis, A. Retha, G. Rosone, F. Vayani, L. Versari, "On-line pattern matching on a set of similar texts", in 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017. [bibtex]
[368]Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos, "On avoided words, absent words, and their application to biological sequence analysis", in Algorithms for Molecular Biology, 2017. [bibtex]
2016
[367]R. Grossi, C. S. Iliopoulos, R. Mercas, N. Pisanti, S. P. Pissis, A. Retha, F. Vayani, "Circular sequence comparison: algorithms and applications", Algorithms for Molecular Biology, vol. 11, no. 1, May 2016, pp. 12. [bibtex] [pdf] [doi]
[366]C. Barton, T. Flouri, C. S. Iliopoulos, S. P. Pissis, "Global Sequence Alignment with a Bounded Number of Gaps", in Pattern Recognition in Computational Molecular Biology: Techniques and Approaches, M. Elloumi et al., Eds., Wiley, 2016, pp. 83-96. [bibtex] [pdf]
[365]C. S. Iliopoulos, S. J. Puglisi, Eds., Dedicated to Professor William F. Smyth on the occasion of his 80th birthday, 2016. [bibtex]
[364]C. S. Iliopoulos, S. P. Pissis and M. S. Rahman, "Searching And Indexing Circular Patterns", in Algorithms for Next-Generation Sequencing, , Ed., Springer, 2016, pp. . [bibtex]
[363]C. S. Iliopoulos, R. Kundu, M. Mohamed, F. Vayani, "Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis", in WALCOM: Algorithms in Bioinformatics, Springer, 2016, pp. 3-14. [bibtex]
[362]P. C. Yannis Almirantis, D. Polychronopoulos, "Optimal Computation of Avoided Words", in Workshop on Algorithms in Bioinformatics (WABI 2016), Springer. [bibtex]
[361]C. S. I. Vida Ghanaei, R. Overill, "Statistical Approach towards Malware Classification and Detection", in SAI Computing Conference 2016. [bibtex]
[360]M. Pellegrini, A. Magi and C. S. Iliopoulos, "Repetitive structures in biological sequences: algorithms and applications", Frontiers, 2016. [bibtex]
[359]M. A. Oluwole Ajala, C. S. Iliopoulos, "A Novel Pattern Matching Approach for Fingerprint-based Authentication", in PATTERNS 2016, IARIA. [bibtex]
[358]C. S. Iliopoulos, R. Kundu and M. Mohamed, "Efficient Computation of Clustered-Clumps in Degenerate Strings", in Artificial Intelligence Applications and Innovations: 12th IFIP WG 12.5 International Conference and Workshops, AIAI 2016, Thessaloniki, Greece, September 16-18, 2016, Proceedings, L. Iliadis, I. Maglogiannis, Eds., Cham: Springer International Publishing, pp. 510-519. [bibtex] [pdf] [doi]
[357]C. Barton, C. S. Iliopoulos, S. P. Pissis, S. Arhondakis, "Transcriptome activity of isochores during pre-implantation process in human and mouse", FEBS Letters, 2016. [bibtex]
[356]C. S. Iliopoulos, J. Radoszewski, "Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties", in Annual Symposium on Combinatorial Pattern Matching (CPM 2016), pp. 8:1-8:12. [bibtex]
[355]C. S. I. Moudhi Aljamea, M. Samiruzzaman, "Detection of URL in Image Steganography", in International Conference on Internet of things and Cloud Computing (ICC 2016), ACM Digital Library, pp. 23:1-23:6. [bibtex]
[354]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Waleń, "Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries", in String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings, S. Inenaga, K. Sadakane, T. Sakai, Eds., Cham: Springer International Publishing, pp. 22-34. [bibtex] [pdf] [doi]
[353]M. Crochemore, C. S. Iliopoulos, R. Kundu, M. Mohamed, F. Vayani, "Linear algorithm for conservative degenerate pattern matching", Engineering Applications of Artificial Intelligence, vol. 51, 2016, pp. 109-114. [bibtex] [pdf] [doi]
[352]M. Samiruzzaman, C. S. Iliopoulos, "Approximate circular pattern matching with a simple and light-weight filter-based algorithm", IEEE Transactions on NanoBioscience, 2016. [bibtex]
[351]G. Badkobeh, M. Crochemore, C. S. Iliopoulos, M. Kubica, "Text redundancies", in Combinatorics, Words and Symbolic Dynamics, V. Berthe, M. Rigo, Eds., 2016, pp. 151-174. [bibtex]
[350]L. Brankovic, C. S. Iliopoulos, R. Kundu, M. Mohamed, S. P. Pissis, F. Vayani, "Linear-time superbubble identification algorithm for genome assembly", Theoretical Computer Science, vol. 609, Part 2, 2016, pp. 374 - 383. [bibtex] [pdf] [doi]
[349]M. Aljamea, L. Brankovic, J. Gao, C. S. Iliopoulos, M. Samiruzzaman, "Smart Meter Data Analysis", in International Conference on Internet of things and Cloud Computing (ICC 2016), ACM Digital Library, pp. 22:1-22:6. [bibtex]
[348]O. Ajala, M. Aljamea, M. Alzamel, C. S. Iliopoulos, "Fast Fingerprint Rotation Recognition Technique Using Circular Strings in Lexicographical Order", in SAI Intelligent Systems, IEEE, 2016. [bibtex]
2015
[347]M. Crochemore, C. S. Iliopoulos, A. Langiu, F. Mignosi, "The longest common substring problem", Mathematical Structures in Computer Science, vol. FirstView, 7 2015, pp. 1-19. [bibtex] [pdf] [doi]
[346]T. Athar, C. Barton, W. Bland, J. Gao, C. S. Iliopoulos, C. Liu, S. P. Pissis, "Fast circular dictionary-matching algorithm", Mathematical Structures in Computer Science, vol. FirstView, 5 2015, pp. 1-14. [bibtex] [doi]
[345]D. E. Daykin, J. W. Daykin, C. S. Iliopoulos, W. F. Smyth, "Generic Algorithms for Factoring Strings", Information Theory, Combinatorics, and Search Theory 2013, 2015, pp. 402-418. [bibtex]
[344]M. A. R. Azim, C. S. Iliopoulos, M. S. Rahman, M. Samiruzzaman, "SimpLiFiCPM: A Simple and Lightweight Filter-based Algorithm for Circular Pattern Matching", International Journal of Genomics, 2015. [bibtex]
[343]R. Grossi, C. S. Iliopoulos, R. Mercas, N. Pisanti, S. P. Pissis, A. Retha, F. Vayani, "Circular Sequence Comparison with q-grams", in Algorithms in Bioinformatics, M. Pop, H. Touzet, Eds., Springer Berlin Heidelberg, 2015, pp. 203-216. [bibtex] [doi]
[342]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Order-Preserving Indexing", Theoretical Computer Science, vol. 638, 2015, pp. 122-135. [bibtex] [doi]
[341]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, J. Radoszewski, W. Rytter, B. Szreder, T. Walen, "A note on the longest common compatible prefix problem for partial words", Journal of Discrete Algorithms, vol. 34, 2015, pp. 49-53. [bibtex]
[340]M. Aljamea, T. Athar, C. S. Iliopoulos, S. P. Pissis, M. S. Rahman, "A Novel Pattern Matching Approach for Fingerprint-based Authentication", in PATTERNS 2015: The Seventh International Conferences on Pervasive Patterns and Applications, IARIA, pp. 45-49. [bibtex]
[339]V. Ghanaei, C. S. Iliopoulos and R. Overill, "A Statistical Approach for Discovering Critical Malicious Patterns in Malware Families", in PATTERNS 2015: The Seventh International Conferences on Pervasive Patterns and Applications, IARIA, pp. 21-26. [bibtex]
[338]A. A. AlMansour, C. S. Iliopoulos, "Using Arabic Microblogs Features in Determining Credibility", Fab 2015, 2015, pp. 1212-1219. [bibtex]
[337]J. W. Daykin, C. S. Iliopoulos, M. Miller, O. Phanalasy, "Antimagicness of Generalized Corona and Snowflake Graphs", Mathematics in Computer Science, vol. 9, no. 1, 2015, pp. 105-111. [bibtex] [pdf] [doi]
[336]M. Christodoulakis, M. Christou, M. Crochemore, C. S. Iliopoulos, "On the appearance of seeds in words", Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 95, 2015, pp. 147-160. [bibtex]
[335]C. Barton, C. S. Iliopoulos and S. P. Pissis, "Average-Case Optimal Approximate Circular String Matching", in Language and Automata Theory and Applications - 9th International Conference Proceedings, 2015, pp. 85-96. [bibtex] [pdf] [doi]
[334]C. Barton, C. S. Iliopoulos, R. Kundu, S. P. Pissis, A. Retha, F. Vayani, "Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment", in Experimental Algorithms - 14th International Symposium, SEA 2015, pp. 247-258. [bibtex] [pdf] [doi]
[333]C. Barton, T. Flouri, C. S. Iliopoulos, S. P. Pissis, "Global and local sequence alignment with a bounded number of gaps", Theoretical Computer Science, vol. 582, 2015, pp. 1-16. [bibtex] [pdf] [doi]
[332]M. A. R. Azim, C. S. Iliopoulos, M. S. Rahman, M. Samiruzzaman, "A Filter-Based Approach for Approximate Circular Pattern Matching", in Bioinformatics Research and Applications - 11th International Symposium, 2015, pp. 24-35. [bibtex] [pdf] [doi]
[331]A. Alatabbi, C. S. Iliopoulos, A. Langiu, M. S. Rahman, "Algorithms for Longest Common Abelian Factors", CoRR, vol. abs/1503.00049, 2015. [bibtex] [pdf]
[330]A. Alatabbi, S. Azmin, M. K. Habib, C. S. Iliopoulos, M. S. Rahman, "SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching", in Bioinformatics and Biomedical Engineering - Third International Conference, 2015, pp. 219-230. [bibtex]
2014
[329]C. S. Iliopoulos, A. Langiu, Eds., Proceedings of the 2nd International Conference on Algorithms for Big Data, Palermo, Italy, April 07-09, 2014, CEUR-WS.org. [bibtex] [pdf]
[328]A. A. AlMansour, L. Brankovic and C. S. Iliopoulos, "A Model for Recalibrating Credibility in Different Contexts and Languages-A Twitter Case Study", International Journal of Digital Information and Wireless Communications (IJDIWC), vol. 4, no. 1, 2014, pp. 53-62. [bibtex]
[327]J. Kim, P. Eades, R. Fleischer, S. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi, T. Tokuyama, "Order-preserving matching", Theoretical Computer Science, vol. 525, 2014, pp. 68-79. [bibtex] [pdf] [doi]
[326]C. S. Iliopoulos, M. Mohamed, "On-line Minimum Closed Covers", in Artificial Intelligence Applications and Innovations 2014 Rhodes Greece September Proceedings, pp. 106-115. [bibtex] [pdf] [doi]
[325]V. Ghanaei, C. S. Iliopoulos and S. P. Pissis, "Detection of Web Spambot in the Presence of Decoy Actions", in 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, BDCloud 2014 Australia, pp. 277-279. [bibtex] [pdf] [doi]
[324]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "Extracting powers and periods in a word from its runs structure", Theoretical Computer Science, vol. 521, 2014, pp. 29-41. [bibtex] [pdf] [doi]
[323]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, K. Stencel, T. Walen, "New simple efficient algorithms computing powers and runs in strings", Discrete Applied Mathematics, vol. 163, Part 3, 2014, pp. 258 - 267. [bibtex] [pdf] [doi]
[322]M. Christodoulakis, M. Christou, M. Crochemore, C. S. Iliopoulos, "Abelian borders in binary words", Discrete Applied Mathematics, vol. 171, 2014, pp. 141-146. [bibtex] [pdf] [doi]
[321]C. Barton, S. P. Pissis, "Optimal computation of all repetitions in a weighted string", in International Conference on Algorithms for Big Data (ICABD2014), C. S. Iliopoulos, A. Langiu, Eds., pp. 9-15. [bibtex] [pdf]
[320]C. Barton, C. S. Iliopoulos, S. P. Pissis, W. F. Smyth, "Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance", in Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers, pp. 49-61. [bibtex] [pdf] [doi]
[319]C. Barton, C. S. Iliopoulos and S. P. Pissis, "Fast algorithms for approximate circular string matching", Algorithms for Molecular Biology, vol. 9, 2014, pp. 9. [bibtex] [pdf] [doi]
[318]C. Barton, C. S. Iliopoulos, "On the Average-case Complexity of Pattern Matching with Wildcards", CoRR, vol. abs/1407.0950, 2014. [bibtex]
[317]C. Barton, C. S. Iliopoulos and S. P. Pissis, "Optimal computation of all tandem repeats in a weighted sequence", Algorithms for Molecular Biology, vol. 9, 2014, pp. 21. [bibtex]
[316]C. Barton, C. S. Iliopoulos, I. Lee, L. Mouchard, K. Park, S. P. Pissis, "Extending alignments with k-mismatches and $-gaps", Theoretical Computer Science, vol. 525, 2014, pp. 80-88. [bibtex] [doi]
[315]G. Badkobeh, H. Bannai, K. Goto, T. I, C. S. Iliopoulos, S. Inenaga, S. J. Puglisi, S. Sugimoto, "Closed Factorization", in Proceedings of the Prague Stringology Conference 2014, pp. 162-168. [bibtex] [pdf]
[314]M. A. R. Azim, C. S. Iliopoulos, M. S. Rahman, M. Samiruzzaman, "A fast and lightweight filter-based algorithm for circular pattern matching", in Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 14 California USA 2014, pp. 621-622. [bibtex] [pdf] [doi]
[313]A. A. AlMansour, L. Brankovic and C. S. Iliopoulos, "Evaluation of credibility assessment for microblogging: models and future directions", in 14th International Conference on Knowledge Management and Data-driven Business, I-KNOW 14, Graz, Austria, September 16-19, 2014, pp. 32:1-32:4. [bibtex] [pdf] [doi]
[312]P. Ahmed, C. S. Iliopoulos, A. S. M. S. Islam, M. S. Rahman, "The swap matching problem revisited", Theoretical Computer Science, vol. 557, 2014, pp. 34-49. [bibtex] [pdf] [doi]
2013
[311]K. Frousios, C. S. Iliopoulos, S. P. Pissis, S. Kossida, G. Tischler, S. Arhondakis, "Transcriptome map of mouse isochores in embryonic and neonatal cortex", Genomics, vol. 101, no. 2, 2013, pp. 120-124. [bibtex]
[310]C. S. Iliopoulos, J. A. Mirza and A. Shah, "Telematics solution for the Teleco industry in the Developing World", in Proceedings of the First International Conference on Green Computing, Technology and Innovation (ICGCTI 2013), pp. 14-20. [bibtex]
[309]J. C. Na, H. Park, M. Crochemore, J. Holub, C. S. Iliopoulos, L. Mouchard, K. Park, "Suffix Tree of an Alignment: An Efficient Index for Similar Data", in Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA) 2013, pp. 337-348. [bibtex]
[308]M. Christodoulakis, M. Christou, M. Crochemore, C. S. Iliopoulos, "Overlapping factors in words", Australasian Journal of Combinatorics, vol. 57, 2013. [bibtex]
[307]J. Kim, P. Eades, R. Fleischer, S. Hong, C. S. Iliopoulos, K. Park, S. J. Puglisi, T. Tokuyama, "Order Preserving Matching", Theoretical Computer Science, vol. December, 2013. [bibtex]
[306]C. S. I. Carl Barton, B. Watson, "Identification of all Exact and Approximate Inverted Repeats in Regular and Weighted Sequences", in Proceedings of the International Conference on Engineering Applications of Neural Networks (EANN) 2013, pp. 11-19. [bibtex]
[305]K. Frousios, C. S. Iliopoulos, T. Schlitt, M. A. Simpson, "Predicting the functional consequences of non-synonymous DNA sequence variants - evaluation of bioinformatics tools and development of a consensus strategy", Genomics, vol. 102, no. 4, 2013, pp. 223-231. [bibtex]
[304]T. Flouri, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, S. J. Puglisi, W. F. Smyth, W. Tyczynski, "Enhanced String Covering", Theoretical Computer Science, vol. 506, 2013, pp. 102-114. [bibtex]
[303]M. Christou, C. S. Iliopoulos and M. Miller, "Degree/diameter problem for trees and pseudotrees", AKCE International Journal of Graphs and Combinatorics, vol. 10(4), 2013, pp. 377-389. [bibtex]
[302]C. S. Iliopoulos, S. P. Pissis, "Algorithms for next-generation sequencing data", in Handbook of Biological Knowledge Discovery, , Ed., Wiley, 2013, pp. . [bibtex]
[301]J. C. Na, H. Park, M. Crochemore, J. Holub, C. S. Iliopoulos, L. Mouchard, K. Park, "Suffix Tree of an Alignment: An Efficient Index for Similar Data", in IWOCA 2013, pp. 337-348. [bibtex]
[300]V. G. Moudhi Aljamea, R. Overill, "Static Analysis and Clustering of Malware Applying Text Based Search", in The International Conference on Digital Information Processing, E-Business and Cloud Computing, SDIWC, 2013, pp. 188-193. [bibtex]
[299]M. A. Ali Alatabbi, C. S. Iliopoulos, "Malware Detection using Computational Biology Tools", International Journal of Engineering and Technology, 2013, pp. 315. [bibtex]
[298]C. S. Iliopoulos, S. P. Pissis, "Verifying an enhanced cover array in linear time", in Formal Aspects of Computing, Essays dedicated to Derrick Kourie on the occasion of his 65th birthday, S. Gruner, B. Watson, Eds., Shaker Verlag, 2013, pp. 111 - 123. [bibtex] [doi]
[297]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Pachocki, J. Radoszewski, W. Rytter, T. W. Wojciech Tycznski, "A note on efficient computation of all Abelian periods in a string", Inf. Process. Lett., vol. 113, no. 3, 2013, pp. 74-77. [bibtex]
[296]C. Barton, C. S. Iliopoulos and S. P. Pissis, "Circular string matching revisited", in Proceedings of the Fourteenth Italian Conference on Theoretical Computer Science (ICTCS 2013), pp. 200-205. [bibtex] [pdf]
[295]T. Flouri, K. Frousios, C. S. Iliopoulos, K. Park, S. P. Pissis, G. Tischler, "GapMis: a tool for pairwise sequence alignment with a single gap", Recent Patents on DNA and Gene Sequence Journal: Pattern Finding in Computational Molecular Biology, vol. 7(2), 2013, pp. 84-95. [bibtex]
[294]M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Walen, "Computing the Longest Previous Factor", The Electronic Journal of Combinatorics, vol. 34, 2013, pp. 15-26. [bibtex]
[293]M. Christou, T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar, S. P. Pissis, J. Zdarek, "Tree template matching in unranked ordered trees", Journal of Discrete Algorithms, vol. 20, 2013, pp. 51 - 60. [bibtex] [pdf] [doi]
[292]C. Barton, M. Giraud, C. S. Iliopoulos, T. Lecroq, L. Mouchard, S. P. Pissis, "Querying Highly Similar Sequences", International Journal or Computation Biology and Drug Design, vol. 6, no. 1-2, 2013, pp. 119-130. [bibtex]
[291]C. Barton, T. Flouri, C. S. Iliopoulos, S. P. Pissis, "GapsMis: Flexible Sequence Alignment with a Bounded Number of Gaps", in Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, New York, NY, USA: ACM, 2013, pp. 402:402-402:411. [bibtex] [pdf] [doi]
[290]A. Alatabbi, C. S. Iliopoulos and M. S. Rahman, Maximal palindromic factorization, 2013, pp. 70-77. [bibtex]
[289]M. Elloumi, P. Hayati, C. S. Iliopoulos, J. A. Mirza, S. P. Pissis, A. Shah, "Comparison for the detection of Virus and spam using pattern matching tools", in Technological Advances in Electrical, Electronics and Computer Engineering (TAEECE), 2013 International Conference on, pp. 304-311. [bibtex] [doi]
2012
[288]C. Hadjinikolis, C. S. Iliopoulos, S. P. Pissis, A. Stamatakis, "Minimising processor communication in parallel approximate string matching", Technical Reports, no. Exelixis-RRDR-2012-8, 2012. [bibtex]
[287]M. Christou, M. Crochemore, T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar, S. P. Pissis, "Computing all subtree repeats in ordered trees", Information Processing Letters, vol. 112, no. 24, 2012, pp. 958-962. [bibtex]
[286]M. Christou, M. Crochemore and C. S. Iliopoulos, "Quasiperiodicities in Fibonacci strings", in Local Proceedings of International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), pp. 13-22. [bibtex]
[285]T. Flouri, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, S. J. Puglisi, W. F. Smyth, W. Tyczynski, "New and efficient approaches to the quasiperiodic characterisation of a string", in Proceedings of the Prague Stringology Conference (PSC 2012), pp. 75-88. [bibtex]
[284]A. Alatabbi, M. Crochemore, C. S. Iliopoulos, T. A. Okanlawon, "Overlapping Repetitions in Weighted Sequence", in Proceedings of the CUBE International Information Technology Conference, 2012, pp. 435-440. [bibtex]
[283]A. Alatabbi, C. Barton, C. S. Iliopoulos, L. Mouchard, "Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations", in Artificial Intelligence Applications and Innovations, L. Iliadis et al., Eds., Springer Berlin Heidelberg, 2012, pp. 584-592. [bibtex]
[282]T. Flour, C. S. Iliopoulos, K. Park, S. P. Pissis, "GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures", in Artificial Intelligence Applications and Innovations, L. Iliadis et al., Eds., Springer Berlin Heidelberg, 2012, pp. 593-601. [bibtex]
[281]K. Chang, C. Barton, C. S. Iliopoulos, J. R. Jang, "Conceptualization, Significance Study Of a New Application CS-MIR", in Artificial Intelligence Applications and Innovations, L. Iliadis et al., Eds., Springer Berlin Heidelberg, 2012, pp. 146-156. [bibtex]
[280]H. Zhang, Q. Guo and C. S. Iliopoulos, "Computing the Minimum lambda-Cover in Weighted Sequences", in ICIC (1), D. Huang et al., Eds., Springer, 2012, pp. 120-127. [bibtex]
[279]T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar, S. P. Pissis, "Tree template matching in ranked ordered trees by pushdown automata", Journal of Discrete Algorithms, vol. 17, 2012, pp. 15-23. [bibtex]
[278]M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, G. Tischler, T. Wallen, "Improved Algorithms for the Range Next Value Problem and Applications", Theoretical Computer Science, vol. 434, 2012, pp. 23-34. [bibtex]
[277]C. S. Iliopoulos, M. Miller and S. P. Pissis, "Parallel algorithms for mapping short degenerate and weighted sequences to a reference genome", International Journal of Foundations of Computer Science, vol. 23, no. 2, 2012, pp. 249-259. [bibtex]
[276]M. Christou, M. Crochemore and C. S. Iliopoulos, "Identifying All Abelian Periods Of A String In Quadratic Time And Relevant Problems", International Journal of foundations of Computer Science, vol. 23, no. 6, 2012, pp. 1371-1384. [bibtex]
[275]M. Christou, M. Crochemore, O. Guth, C. S. Iliopoulos, S. P. Pissis, "On left and right seeds of a string", Journal of Discrete Algorithms, vol. 17, 2012, pp. 31-44. [bibtex]
[274]T. Flouri, C. S. Iliopoulos, S. P. Pissis, G. Tischler, "Mapping short reads to a genomic sequence with circular structure", International Journal of Systems Biology and Biomedical Technologies, vol. 1, no. 1, 2012, pp. 26-34. [bibtex]
[273]C. S. Iliopoulos, S. Michalakopoulos, M. S. Rahman, J. W. Chan, "Exact and approximate rhythm matching algorithms", International Journal on Digital Libraries, vol. 12, 2012, pp. 149-158. [bibtex]
[272]M. Elloumi, P. Hayati, C. S. Iliopoulos, S. P. Pissis, A. Shah, "Detection of fixed length web spambot using REAL (read aligner)", in Proceedings of the CUBE International Information Technology Conference, ACM, 2012, pp. 820-825. [bibtex]
[271]M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Walen, "Efficient algorithms for three variants of the LPF table", Journal of Discrete Algorithms, vol. 11, 2012, pp. 51-61. [bibtex]
[270]H. Zhang, Q. Guo and C. S. Iliopoulos, "Locating Tandem Repeats in Weighted Biological Sequences", in ICIC (3), D. Huang et al., Eds., Springer, 2012, pp. 118-123. [bibtex]
[269]M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, J. Radoszewski, W. Rytter, W. Tyczynski, T. Walen, "The Maximum Number of Squares in a Tree", in CPM, J. Kärkkäinen, J. Stoye, Eds., Springer, 2012, pp. 27-40. [bibtex]
[268]M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. P. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Walen, "Efficient seed computation revisited", Theoretical Computer Science, 2012. [bibtex] [doi]
[267]J. W. Chan, C. S. Iliopoulos, S. Michalakopoulos, M. S. Rahman, "Exact and approximate rhythm matching algorithms", International Journal on Digital Libraries, vol. 12, no. 2-3, 2012, pp. 149-158. [bibtex] [doi]
[266]A. Alatabbi, C. S. Iliopoulos, "Morphological Anlysis and generation for arabic language", International Journal of Wireless Information Networks & Business Information System, vol. May/June, 2012. [bibtex]
[265]C. Barton, E. Cambouropoulos, C. S. Iliopoulos, Z. Liptak, "Melodic String Matching via Interval Consolidation and Fragmentation", in Artificial Intelligence Applications and Innovations, 2012, pp. 460-469. [bibtex]
[264]A. Alatabbi, C. Barton and C. S. Iliopoulos, "On the repetitive collection indexing problem", 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2012, pp. 682-687. [bibtex]
2011
[263]M. Christou, M. Crochemore, C. S. Iliopoulos, M. Kubica, S. P. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Walen, "Efficient seed computation revisited", in Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Springer, pp. 350-363. [bibtex]
[262]T. Flouri, K. Frousios, C. S. Iliopoulos, K. Park, S. P. Pissis, G. Tischler, "Approximate string-matching with a single gap for sequence alignment", in Proceedings of the 2nd ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB 2011), ACM, pp. 490-492. [bibtex]
[261]T. Flouri, C. S. Iliopoulos and S. P. Pissis, "DynMap : mapping short reads to multiple related genomes", in Proceedings of the 2nd ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB 2011), ACM, pp. 330-334. [bibtex]
[260]M. Christou, M. Crochemore, T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar, S. P. Pissis, "Computing All Subtree Repeats in Ordered Ranked Trees", in String Processing and Information Retrieval, R. Grossi, F. Sebastiani, F. Silvestri, Eds., Springer Berlin / Heidelberg, 2011, pp. 338-343. [bibtex]
[259]O. Phanalasy, M. Miller, C. S. Iliopoulos, S. P. Pissis, E. Vaezpour, "Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs", Mathematics in Computer Science, vol. 5, no. 1, 2011, pp. 81-87. [bibtex]
[258]C. S. Iliopoulos, D. Kourie, L. Mouchard, T. K. Musombuka, S. P. Pissis, C. d. Ridder, "An algorithm for mapping short reads to a dynamically changing genomic sequence", Journal of Discrete Algorithms, vol. 10, 2011, pp. 15-22. [bibtex]
[257]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "On the Maximal Number of Cubic Runs in a String", Journal of Computer and System Sciences, 2011. [bibtex]
[256]C. S. Iliopoulos, W. F. Smyth, Eds., Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Springer, 2011. [bibtex]
[255]C. S. Iliopoulos, M. Mohamed and W. F. Smyth, "New Complexity Results for the k-Covers Problem", International Journal of Information Sciences, vol. 181, 2011, pp. 2571-2575. [bibtex]
[254]T. Flouri, J. Janousek, B. Melichar, C. S. Iliopoulos, S. P. Pissis, "Tree Indexing by Pushdown Automata and Repeats of Subtrees", in FedCSIS, 2011, pp. 899-902. [bibtex]
[253]M. Christou, M. Crochemore, O. Guth, C. S. Iliopoulos, S. P. Pissis, "On the right-seed array of a string", in Proceedings of the 17th Annual International Conference on Computing and Combinatorics, Springer-Verlag, 2011, pp. 492-502. [bibtex]
[252]T. Flouri, J. Janousek, B. Melichar, C. S. Iliopoulos, S. P. Pissis, "Tree template matching in ranked ordered trees by pushdown automata", in Proceedings of the 16th international conference on Implementation and application of automata, Springer-Verlag, 2011, pp. 273-281. [bibtex]
[251]S. Arhondakis, K. Frousios, C. S. Iliopoulos, S. P. Pissis, G. Tischler, S. Kossida, "Transcriptome map of mouse isochores", BMC Genomics, vol. 12, no. 1, 2011, pp. 511. [bibtex] [doi]
2010
[250]A. A. Albrecht, A. V. Chashkin, C. S. Iliopoulos, O. M. Kasim-Zade, G. Lappas, K. Steinhöfel, "A Note on a priori Estimations of Classification Circuit Complexity", Fundamenta Informaticae, vol. 104, no. 3, December 2010, pp. 201-217. [bibtex]
[249]K. K. Chang, S. P. Pissis, J. R. Jang, C. S. Iliopoulos, "Sub-nyquist audio fingerprinting for music recognition", in Computer Science and Electronic Engineering Conference (CEEC), 2010 2nd, pp. 1-5. [bibtex] [doi]
[248]M. Christodoulakis, C. S. Iliopoulos, "Recent Advances in Weighted DNA Sequences", in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, M. Elloumi, A. Y. Zomaya, Eds., Wiley, 2010, pp. 143-167. [bibtex] [doi]
[247]C. S. Iliopoulos, S. Michalakopoulos, "A Combinatorial Model for ECG Interpretation", International Journal of Biological and Life Sciences, vol. 2, no. 1, 2010, pp. 10 - 15. [bibtex]
[246]M. C. S. Iliopoulos, "Advances in Combinatorial Algorithms II", Special issue of Mathematics in Computer Science, vol. 3, no. 4, 2010. [bibtex]
[245]P. Antoniou, C. S. Iliopoulos, "New developments in processing of degenerate sequences", in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, M. Elloumi, A. Y. Zomaya, Eds., Wiley, 2010, pp. 73-89. [bibtex] [doi]
[244]M. Crochemore, M. Cygan, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "Algorithms for three versions of the shortest common superstring problem", in Proceedings of the 21st Annual Conference on Combinatorial pattern matching, Berlin, Heidelberg: Springer-Verlag, 2010, pp. 299-309. [bibtex]
[243]M. Crochemore, C. S. Iliopoulos, S. P. Pissis, G. Tischler, "Cover array string reconstruction", in Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Springer, pp. 251-259. [bibtex]
[242]P. Antoniou, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "A Fast and Efficient Algorithm for Mapping Short Sequences to a Reference Genome", in Advances in Computational Biology, H. R. Arabnia, Ed., Springer New York, 2010, pp. 399-403. [bibtex]
[241]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "Extracting powers and periods in a string from its runs structure", in Proceedings of the 17th international conference on String processing and information retrieval, Berlin, Heidelberg: Springer-Verlag, 2010, pp. 258-269. [bibtex]
[240]M. Crochemore, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Walen, "Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays", in SOFSEM 2010: Theory and Practice of Computer Science, J. v. Leeuwen et al., Eds., Springer Berlin / Heidelberg, pp. 296-307. [bibtex]
[239]H. Zhang, Q. Guo, J. Fan, C. S. Iliopoulos, "Loose and Strict Repeats in Weighted Sequences of Proteins", Protein and Peptide Letters, vol. 17, no. 9, 2010, pp. 1136-1142. [bibtex]
[238]C. S. I. M. P. Pissis, "A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies", in Proceedings of the International Conference on Parallel Computing (PARCO 2009), IOS Press, 2010, pp. 150-157. [bibtex]
[237]C. S. Iliopoulos, S. Michalakopoulos, "Combinatorial ECG analysis for mobile devices", in Proceedings of the international conference on Multimedia information retrieval, New York, NY, USA: ACM, 2010, pp. 409-412. [bibtex]
[236]M. Crochemore, C. S. Iliopoulos and S. P. Pissis, "A Parallel Algorithm for Fixed-length Approximate String Matching with k-mismatches", Algorithms and Applications, vol. 6060, 2010, pp. 92-101. [bibtex]
[235]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "On the Maximal Number of Cubic Runs in a String", in Language and Automata Theory and Applications, A. Dediu, H. Fernau, C. Martín-Vide, Eds., Springer Berlin / Heidelberg, 2010, pp. 227-238. [bibtex]
[234]C. S. Iliopoulos, M. S. Rahman, M. Voracek, L. Vagner, "Finite Automata Based Algorithms on Subsequences and Supersequences of Degenerate Strings", Journal of Discrete Algorithms, vol. 8, no. 2, 2010, pp. 118-130. [bibtex]
[233]C. S. Iliopoulos, T. A. Okanlawon, S. P. Pissis, G. Tischler, "Mapping short reads to a genomic sequence with circular structure", in Proceedings of the 10th IEEE Internation Conference on Information Technology and Applications in Biomedicine (ITAB 2010). [bibtex]
[232]K. K. Chan, J. R. Jang and C. S. Iliopoulos, "Music genre classification via compressive sampling", in Proceedings of the Eleventh International Society for Music Information Retrieval Conference (ISMIR 2010), J. S. Downie, R. C. Veltkamp, Eds., pp. 387-392. [bibtex]
[231]M. Crochemore, S. Z. Fazekas, C. S. Iliopoulos, I. Jayasekera, "Number of Occurrences of powers in Strings", Int. J. Found. Comput. Sci., vol. 21, no. 4, 2010, pp. 535-547. [bibtex]
[230]P. Antoniou, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "Algorithms for mapping short degenerate and weighted sequences to a reference genome", Internation Journal of Computational Biology and Drug Design, vol. 2, no. 4, 2010, pp. 385-397. [bibtex]
[229]M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Walen, "Finding patterns in given intervals", Fundamenta Informaticae, vol. 101, 2010, pp. 1-14. [bibtex]
[228]H. Zhang, Q. Guo and C. S. Iliopoulos, "An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences", in Algorithms and Complexity, T. Calamoneri, J. Diaz, Eds., Springer Berlin / Heidelberg, 2010, pp. 335-346. [bibtex]
[227]H. Zhang, Q. Guo and C. S. Iliopoulos, "Varieties of Regularities in Weighted Sequences", in Algorithmic Aspects in Information and Management, B. Chen, Ed., Springer Berlin / Heidelberg, 2010, pp. 271-280. [bibtex]
[226]J. Allali, P. Ferraro, C. S. Iliopoulos, S. Michalakopoulos, "Combinatorial detection of arrhythmia", in Proceedings of the 3rd International Conference on Bio-inspired Systems and Signal Processing (BIOSIGNALS 2010), pp. 180-187. [bibtex]
[225]T. Flouri, J. Holub, C. S. Iliopoulos, S. P. Pissis, "An algorithm for mapping short reads to a dynamically changing genomic sequence", in Proceedings of the International Conference on Bioinformatics & Biomedicine (BIBM 2010), pp. 133-136. [bibtex]
[224]K. Frousios, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, G. Tischler, "REAL: An efficient REad ALigner for next generation sequencing reads", in Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB 2010), pp. 154-159. [bibtex]
2009
[223]C. S. Iliopoulos, W. Rytter, Eds., String Algorithms: Dedicated to Professor Maxime Crochemore on the occasion of his 60th birthday, Elsevier, 2009. [bibtex]
[222]M. Crochemore, L. Ilie, C. S. Iliopoulos, M. Kubica, W. Rytter, T. Waleń, "LPF computation revisited", in Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA 2009), J. Fiala, J. Kratochvil, M. Miller, Eds., Springer, pp. 158-169. [bibtex]
[221]C. S. I. Michalakopoulos, "A Combinatorial Model for ECG Interpretation", in Proceedings of the International Conference on Medical Informatics and Biomedical Engineering (ICMIBE 2009), C. Ardil, Ed., World Academy of Science, Engineering and Technology, pp. 451-456. [bibtex]
[220]J. A. A. F. S. I. Michalakopoulos, "Overlay Problems for Music and Combinatorics", in Proceedings of the International Conference on Auditory Display / Computer Music Modeling and Retrieval (ICAD/CMMR 2009), M. Aramaki et al., Eds., Re:New - Digital Arts Forum. [bibtex]
[219]M. Crochemore, C. S. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, "On the maximal number of highly periodic runs in a string", CoRR, vol. abs/0907.2157, 2009. [bibtex]
[218]C. S. I. M. P. Pissis, "Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies", in Proceedings of the Prague Stringology Conference (PSC 2009), J. Holub, J. Zdarek, Eds., pp. 249-262. [bibtex]
[217]P. Antoniou, J. W. Daykin, C. S. Iliopoulos, D. Kourie, L. Mouchard, S. P. Pissis, "Mapping uniquely occuring short sequences derived from high throughput technologies to a reference genome", in Proceedings of the 9th IEEE International Conference on Information Technology and Applications in Biomedicine (ITAB 2009). [bibtex] [doi]
[216]C. S. I. F. S. Yusufu, "Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences", Fundamenta Informaticae, 2009, pp. . [bibtex]
[215]C. S. Iliopoulos, M. S. Rahman and W. Rytter, "Algorithms for two versions of LCS problem for indeterminate strings", Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 71, 2009, pp. 155-172. [bibtex]
[214]P. A. S. I. M. P. Pissis, "Practical and efficient algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies", in Proceedings of the Bioinformatics, Systems Biology and Intelligent Computing, International Joint Conference (IJCBS 2009), pp. 174-180. [bibtex]
[213]C. S. Iliopoulos, M. Miller and Z. Ryjacek, "On Diregularity of Digraphs of Defect at Most Two", Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 71, 2009, pp. 21-38. [bibtex]
[212]M. Crochemore, S. Z. Fazekas, C. S. Iliopoulos, I. Jayasekera, "Bounds on powers in strings", in International Conference on Developments in Language Theory (DLT'09), M. Ito, M. Toyama, Eds., Springer-Verlag, pp. 206-215. [bibtex]
[211]J. Allali, P. Ferraro, P. Hanna, C. S. Iliopoulos, M. Robine, "Toward a General Framework for Polyphonic Comparison", Fundamenta Informaticae, vol. 97, no. 3, 2009, pp. 331-346. [bibtex]
[210]Y. J. P. Ardila, M. Christodoulakis, C. S. Iliopoulos, M. Mohamed, "Efficient (__MATH0__, __MATH1__)-pattern-matching with don't cares", Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 70, 2009, pp. 221-234. [bibtex]
[209]J. A. A. S. I. F. Mohamed, "Validation and Decomposition of Partially Occluded Images with Holes", in Proceedings of the Prague Stringology Conference (PSC 2009), J. Holub, J. Zdarek, Eds., pp. 129-136. [bibtex]
2008
[208]P. Antoniou, C. S. Iliopoulos, I. Jayasekera, W. Rytter, "Computing Repetitive Structures in Indeterminate Strings", in Proceedings of the 3rd IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB 2008). [bibtex]
[207]P. Antoniou, M. Crochemore, C. S. Iliopoulos, I. Jayasekera, G. Landau, "Conservative string covering of indeterminate strings", in Proceedings of the 13th Prague Stringology Conference (PSC 2008), J. Holub, J. Zdarek, Eds., Prague, Czech Republic: Czech Technical University, pp. 108-115. [bibtex]
[206]J. W. T. Chan, C. S. Iliopoulos, S. Michalakopoulos, M. S. Rahman, "Erratic Dancing", in Proceedings of the 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008), K. Jensen, Ed., Copenhagen, Denmark: Re:New - Digital Arts Forum, pp. 117-129. [bibtex]
[205]C. S. Iliopoulos, M. S. Rahman, "Indexing Circular Patterns", in Proceedings of the Workshop on Algorithms and Computation, 2008, pp. 46-57. [bibtex]
[204]C. S. Iliopoulos, M. S. Rahman, "A New Model to Solve Swap Matching Problem and Efficient Algorithms for Short Patterns", in Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '08), pp. 316-327. [bibtex]
[203]M. Christodoulakis, C. S. Iliopoulos, M. S. Rahman, W. F. Smyth, "Identifying Rhythms in Musical Texts", International Journal of Foundations of Computer Science, vol. 19, no. 1, 2008, pp. 37-51. [bibtex]
[202]C. S. Iliopoulos, M. Miller, "Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia", Journal of Discrete Algorithms, vol. 6, no. 1, 2008, pp. 1-2. [bibtex]
[201]C. S. Iliopoulos, M. S. Rahman, "New efficient algorithms for the LCS and constrained LCS problems", Information Processing Letters, vol. 106, no. 1, 2008, pp. 13-18. [bibtex]
[200]C. S. Iliopoulos, M. S. Rahman, "Faster index for property matching", Information Processing Letters, vol. 105, no. 6, 2008, pp. 218-223. [bibtex]
[199]C. S. Iliopoulos, M. S. Rahman, "Algorithms for computing variants of the longest common subsequence problem", Theoretical Computer Science, vol. 395, no. 2-3, 2008, pp. 255-267. [bibtex]
[198]C. S. Iliopoulos, L. Mouchard and M. S. Rahman, "A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching", Mathematics in Computer Science, vol. 1, no. 4, 2008, pp. 557-569. [bibtex]
[197]H. Zhang, Q. Guo and C. S. Iliopoulos, "Generalized approximate regularities in strings", International Journal of Computer Mathematics, vol. 85, no. 2, 2008, pp. 155-168. [bibtex]
[196]H. Zhang, Q. Guo and C. S. Iliopoulos, "Algorithms for Computing the __MATH0__-regularities in Strings", Fundamenta Informaticae, vol. 84, no. 1, 2008, pp. 33-49. [bibtex]
[195]T. Flouri, C. S. Iliopoulos, M. S. Rahman, L. Vagner, M. Vorácek, "Indexing Factors in DNA/RNA Sequences", in Bioinformatics Research and Development, 2008, pp. 436-445. [bibtex]
[194]M. Crochemore, C. S. Iliopoulos and M. S. Rahman, "Optimal prefix and suffix queries on texts", Information Processing Letters, vol. 108, no. 5, 2008, pp. 320-325. [bibtex] [doi]
[193]K. Roh, M. Crochemore, C. S. Iliopoulos, K. Park, "External memory algorithms for string problems", Fundamenta Informaticae, vol. 84, 2008, pp. 1-16. [bibtex]
[192]R. Clifford, C. S. Iliopoulos, G. M. Landau, M. Mohamed, Y. Pinzon, "Necklace Swap Problem for Rhythmic Similarity Measures", International Journal of Computational Methods, vol. 5, no. 3, 2008, pp. 351-363. [bibtex]
[191]M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, "Improved algorithms for the range next value problem and applications", in International Symposium on Theoretical Aspects of Computer Science (STACS'08), S. Albers, P. Weil, Eds., IBFI Schloss Dagstuhl, pp. 205-216. [bibtex]
[190]P. Antoniou, C. S. Iliopoulos, I. Jayasekera, M. S. Rahman, "Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model", in Bioinformatics Research and Development, 2008, pp. 446-455. [bibtex]
[189]A. Amir, E. Chencinski, C. S. Iliopoulos, T. Kopelowitz, H. Zhang, "Property matching and weighted matching", Theor. Comput. Sci., vol. 395, no. 2-3, 2008, pp. 298-310. [bibtex]
2007
[188] Dafik, C. S. Iliopoulos, M. Miller, Z. Ryjacek, "On diregularity of digraphs of defect two", in International Workshop on Combinatorial Algorithms (IWOCA), L. Brankovich, Y. Lin, W. F. Smyth, Eds., 2007, pp. 25-34. [bibtex]
[187]J. Allali, P. Ferraro, P. Hanna, C. S. Iliopoulos, "Local Transpositions in Alignment of Polyphonic Musical Sequences", in Proceedings of the 14th String Processing and Information Retrieval Symposium, Santiago, Chile: Springer, 2007, pp. 26-38. [bibtex]
[186]C. S. Iliopoulos, M. S. Rahman, "New Efficient Algorithms for LCS and Constrained LCS Problem", in Proceedings of the 3rd Algorithms and Complexity in Durham Workshop, H. Broersma et al., Eds., Durham, UK: College Publications London, 2007, pp. 83-94. [bibtex]
[185]C. S. Iliopoulos, M. S. Rahman, M. Vorácek, L. Vagner, "Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata", in Proceedings of the 3rd Algorithms and Complexity in Durham Workshop, H. Broesma, M. J. S. Dantcher, S. Szeider, Eds., 2007, pp. 95-106. [bibtex]
[184]C. S. Iliopoulos, M. S. Rahman, M. Voracek, L. Vagner, "The Constrained Longest Common Subsequence Problem for Degenerate Strings", in Proceedings of the 12th International Conference on Implementation and Application of Automata, J. Holub, J. Zdarek, Eds., Prague, Czech Republic: Springer, 2007, pp. 309-311. [bibtex]
[183]A. L. P. Chen, C. S. Iliopoulos, S. Michalakopoulos, M. S. Rahman, "Implementation of Algorithms to Classify Musical Texts According to Rhythms", in Proceedings of the 4th Sound and Music Computing Conference (SMC '07), C. Spyridis et al., Eds., Lefkada, Greece: National and Kapodistrian University of Athens, pp. 134-141. [bibtex]
[182]C. S. Iliopoulos, M. Kubica, M. S. Rahman, T. Waleń, "Algorithms for Computing the Longest Parameterized Common Subsequence", in Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, B. Ma, Z. Zhang, Eds., Ontario, Canada: Springer, 2007, pp. 265-273. [bibtex]
[181]M. S. Rahman, C. S. Iliopoulos, "A New Efficient Algorithm for computing the Longest Common Subsequence", in Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management, M. Y. Kao, X. Y. Li, Eds., Portland, USA: Springer, 2007, pp. 82-90. [bibtex]
[180]C. S. Iliopoulos, I. Lee and S. Ohn, "Transformation of Suffix Arrays into Suffix Trees on the MPI Environment", in Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing (RSFDGrC 07), A. An et al., Eds., Toronto, Canada: Springer, 2007, pp. 248-255. [bibtex]
[179]C. S. Iliopoulos, I. Jayasekera, B. Melichar, J. Supol, "Weighted degenerated approximate pattern matching", in Proceedings of the 1st International Conference on Language and Automata Theory and Applications, R. Loos, S. Z. Fazekas, C. Martin-Vide, Eds., 2007, pp. 285-296. [bibtex]
[178]M. S. Rahman, C. S. Iliopoulos and L. Mouchard, "Pattern Matching in Degenerate DNA/RNA Sequences", in Proceedings of the Workshop on Algorithms and Computation, M. Kaykobad, M. S. Rahman, Eds., Dhaka, Bangladesh: Bangladesh Academy of Sciences, 2007, pp. 109-120. [bibtex]
[177]M. S. Rahman, C. S. Iliopoulos, "Indexing Factors with Gaps", in Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), J. v. Leeuwen et al., Eds., Harrachov, Czech Republic: Springer, 2007, pp. 465-474. [bibtex]
[176]M. S. Rahman, C. S. Iliopoulos, "Pattern Matching Algorithms with Don't Cares", in Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM07), J. v. Leeuwen et al., Eds., Institute of Computer Science AS CR, Prague, 2007, pp. 116-126. [bibtex]
[175]I. Lee, C. S. Iliopoulos and K. Park, "Linear time algorithm for the longest common repeat problem", Journal of Discrete Algorithms, vol. 5, no. 2, 2007, pp. 243-249. [bibtex]
[174]C. S. Iliopoulos, K. Perdikuri, E. Theodoridis, A. K. Tsakalidis, K. Tsichlas, "Algorithms for extracting motifs from biological weighted sequences", Journal of Discrete Algorithms, vol. 5, no. 2, 2007, pp. 229-242. [bibtex]
[173]C. S. Iliopoulos, M. S. Rahman, "A New Efficient Algorithm for Computing the Longest Common Subsequence", Theory of Computing Systems, vol. 45, no. 2, 2007, pp. 355-371. [bibtex]
[172]C. S. Iliopoulos, M. S. Rahman, "Indexing Factors with Gaps", Algorithmica, vol. 55, no. 1, 2007, pp. 60-70. [bibtex]
[171]Q. Guo, H. Zhang and C. S. Iliopoulos, "Computing the __MATH0__-covers of a string", Inf. Sci., vol. 177, no. 19, 2007, pp. 3957-3967. [bibtex]
[170]M. Crochemore, C. S. Iliopoulos and M. S. Rahman, "Finding Patterns in Given Intervals", in Mathematical Foundations of Computer Science (MFCS'07), L. Kucera, A. Kucera, Eds., Springer-Verlag, Berlin, pp. 645-656. [bibtex]
[169]E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, M. Mohamed, M. Sagot, "All maximal-pairs in step-leap representation of melodic sequence", Inf. Sci., vol. 177, no. 9, 2007, pp. 1954-1962. [bibtex]
[168]A. Bakalis, C. S. Iliopoulos, C. Makris, S. Sioutas, E. Theodoridis, A. Tsakalidis, K. Tsichlas, "Locating Maximal Multirepeats in Multiple Strings Under Various Constraints", The Computer Journal, vol. 50, no. 2, 2007, pp. 178-185. [bibtex]
[167]P. Antoniou, M. Crochemore, C. S. Iliopoulos, P. Peterlongo, "Application of suffix trees for the acquisition of common motifs with gaps in a set of strings", in 1st International Conference on Language and Automata Theory and Applications (LATA'07), R. Loos, S. Z. Fazekas, C. Martin-Vide, Eds., Universitat Rovira i Virgili, pp. 57-66. [bibtex]
[166]A. A. Albrecht, A. V. Chashkin, C. S. Iliopoulos, O. M. Kasim-Zade, G. Lappas, K. Steinhöfel, "A Priori Estimation of Classification Circut Complexity", in London Algorithmics and Stringology, J. Daykin, M. Mohamed, K. Steinhofel, Eds., College Publications, 2007, pp. 97-114. [bibtex]
[165]Y. J. P. Ardila, M. Christodoulakis, G. B. Golding, C. S. Iliopoulos, W. F. Smyth, "Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences", Journal of Computational Biology, vol. 14, no. 7, 2007, pp. 1001 - 1010. [bibtex]
2006
[164]C. S. Iliopoulos, M. S. Rahman, "Algorithms for Computing Variants of the Longest Common Subsequence Problem", in Proceedings of the 17th International Symposium on Algorithms and Computation, T. Asano, Ed., Kolkata, India: Springer, 2006, pp. 399-408. [bibtex]
[163]A. Bakalis, C. S. Iliopoulos, S. Sioutas, K. Tsichlas, "Algorithms for Bitmasking Strings", in Proceedings of International Conference of Computational Methods in Sciences and Engineering, T. Simos, G. Maroulis, Eds., 2006, pp. 1061-1063. [bibtex]
[162]M. Christodoulakis, C. S. Iliopoulos, M. S. Rahman, W. F. Smyth, "Song Classifications for Dancing", in Proceedings of the 11th Prague Stringology Conference, J. Holub, J. Zdarek, Eds., Czech Republic: Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2006, pp. 41-48. [bibtex]
[161]M. S. Rahman, C. S. Iliopoulos, I. Lee, M. Mohamed, W. F. Smyth, "Finding Patterns with Variable Length Gaps or Don't Cares", in Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06), D. Z. Chen, D. T. Lee, Eds., Taipei, Taiwan: Springer, pp. 146-155. [bibtex]
[160]P. Antoniou, J. Holub, C. S. Iliopoulos, B. Melichar, P. Peterlongo, "Finding Common Motifs with Gaps using Finite Automata", in Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), O. H. Ibarra, H. Yen, Eds., Taipei, Taiwan: Springer Berlin / Heidelberg, pp. 69-77. [bibtex]
[159]A. Amir, C. S. Iliopoulos, O. Kapah, E. Porat, "Approximate matching in weighted sequences", in Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06), M. Lewenstein, G. Valiente, Eds., Barcelona, Spain: Springer Berlin / Heidelberg, 2006, pp. 365-376. [bibtex]
[158]C. S. Iliopoulos, I. Jayasekera and L. Mouchard, "Fast practical exact and approximate pattern matching in protein sequences", in Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms, J. Ryan, Dafik, Eds., 2006, pp. . [bibtex]
[157]M. Crochemore, C. S. Iliopoulos, K. Park, K. Roh, "External Memory Algorithms for String Problems", in Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms, J. Ryan, Dafik, Eds., 2006, pp. . [bibtex]
[156]H. Zhang, Q. Guo and C. S. Iliopoulos, "Computing the __MATH0__-Seeds of a String", vol. 4041, no. 32, June 2006, pp. 303-313. [bibtex]
[155]C. S. Iliopoulos, K. Park, K. Steinhöfel, Eds., Algorithms in Bioinformatics, College Publications, 2006. [bibtex]
[154]C. S. Iliopoulos, C. Makris, Y. Panagis, K. Perdikuri, E. Theodoridis, A. Tsakalidis, "The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications", Fundamenta Informaticae, vol. 71, no. 2-3, 2006, pp. 259-277. [bibtex]
[153]H. Zhang, Q. Guo, C. S. Iliopoulos, H. Zhang, "Computing the minimum approximate __MATH0__ -cover of a string", in Proceedings of the 13th Symposium on String Processing and Information Retrieval, F. Crestani, P. Ferragina, M. Sanderson, Eds., Springer, 2006, pp. 49-60. [bibtex]
[152]M. Christodoulakis, C. S. Iliopoulos and Y. Pinzón, "Simple Algorithm for Sorting All the Fibonacci String Rotations", in Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), J. Wiedermann et al., Eds., Springer-Verlag, 2006, pp. 218-225. [bibtex]
[151]M. Crochemore, C. S. Iliopoulos, M. Mohamed, M. Sagot, "Longest Repeats with a Block of $k$ Don't Cares", Theoretical Computer Science, vol. 362, no. 1-3, 2006, pp. 248-254. [bibtex]
[150]M. Christodoulakis, C. S. Iliopoulos, L. Mouchard, K. Perdikuri, A. Tsakalidis, K. Tsichlas, "Computation of Repetitions and Regularities of Biological Weighted Sequences", Journal of Computational Biology, vol. 13, no. 6, 2006, pp. 1214-1231. [bibtex]
[149]Y. J. P. Ardila, M. Christodoulakis and C. S. Iliopoulos, "Simple Algorithm for sorting the Fibonacci string rotations", International Journal of Pure and Applied Mathematics, vol. 31, no. 1, 2006, pp. 97 - 107. [bibtex]
2005
[148]C. S. Iliopoulos, K. Perdikuri, A. Tsakalidis, K. Tsichlas, "Algorithms for extracting structured motifs from biologically weighted sequences", in Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA), J. Ryan et al., Eds., 2005, pp. 125-136. [bibtex]
[147]Y. J. P. Ardila, M. Christodoulakis, C. S. Iliopoulos, M. Mohamed, "Efficient (__MATH0__,__MATH1__)-Pattern-Matching with Don't Cares", in Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA), J. Ryan et al., Eds., 2005, pp. 27-38. [bibtex]
[146]J. Pickens, C. S. Iliopoulos, "Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval", in Proceedings of the 6th International Conference on Music Information Retrieval, 2005, pp. 207-214. [bibtex]
[145]I. Lee, C. S. Iliopoulos, "Two simple heuristics for the pattern matching on weighted sequences", in Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA), J. Ryan et al., Eds., 2005, pp. 409-414. [bibtex]
[144]F. S. Arikat, A. Bakalis, M. Christodoulakis, C. S. Iliopoulos, L. Mouchard, "Experimental results in pattern matching on weighted sequences", in Proceedings of International Conference on Numerical Analysis and Applied Mathematics, T. Simos, G. Maroulis, Eds., 2005, pp. 822-826. [bibtex]
[143]C. S. Iliopoulos, J. McHugh, P. Peterlongo, N. Pisanti, W. Rytter, M. Sagot, "A First Approach to Finding Common Motifs with Gaps", International Journal of Foundations of Computer Science, vol. 16, no. 6, 2005, pp. 1145-1155. [bibtex]
[142]C. S. Iliopoulos, G. M. Landau, M. Mohamed, Y. Pinzon, "Approximation Algorithm for the Cyclic Swap Problem", in Proceedings of the Prague Stringology Conference (PSC'05), J. Holub, M. Simanek, Eds., pp. 190-200. [bibtex]
[141]M. Christodoulakis, C. S. Iliopoulos, K. Park, J. S. Sim, "Approximate Seeds of Strings", Journal of Automata, Languages and Combinatorics, vol. 10, 2005, pp. 609-626. [bibtex]
[140]M. Crochemore, C. S. Iliopoulos, G. Navarro, Y. Pinzon, A. Salinger, "Bit-parallel __MATH0__-matching and suffix automata", Journal of Discrete Algorithms, vol. 3, no. 2-4, 2005, pp. 198-214. [bibtex]
[139]R. Cole, C. S. Iliopoulos, M. Mohamed, W. F. Smyth, L. Yang, "The Complexity of the Minimum k-Cover Problem", Journal of Automata, Languages and Combinatorics, vol. 10, no. 5, 2005. [bibtex]
[138]R. Clifford, R. Groult, C. S. Iliopoulos, R. Byrd, "Music Retrieval Algorithms for The Lead Sheet Problem", Journal of New Music Research, vol. 34, 2005, pp. 311-317. [bibtex]
[137]E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, M. Mohamed, M. Sagot, "A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories", in Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR 2005), T. Crawford, M. Sandler, Eds., pp. 167-174. [bibtex]
[136]P. Clifford, R. Clifford and C. S. Iliopoulos, "Faster algorithms for __MATH0__, __MATH1__-matching and related problems", in Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05), A. Apostolico, M. Crochemore, K. Park, Eds., Springer, pp. 68-78. [bibtex]
2004
[135]H. Zhang, Q. Guo and C. S. Iliopoulos, "String Matching with swaps in a Weighted Sequence", in Proceedings of International Symposium on Computational and Information Sciences (CIS 04), 2004, pp. 698-704. [bibtex]
[134]C. S. Iliopoulos, K. Perdikuri, E. Theodoridis, A. Tsakalidis, K. Tsichlas, "Motif Extraction from Weighted Sequences", in Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04), A. Apostolico, M. Melucci, Eds., Padova, Italy: Springer-Verlag Heidelberg, pp. 286-297. [bibtex]
[133]I. Lee, C. S. Iliopoulos and K. Park, "Linear time algorithm for the longest common repeat problem", in Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04), A. Apostolico, M. Melucci, Eds., Padova, Italy: Springer-Verlag Heidelberg, pp. 10-17. [bibtex]
[132]R. Clifford, C. S. Iliopoulos, "String algorithms in Music Analysis", Soft Computing, vol. 8, no. 9, 2004, pp. 597-603. [bibtex]
[131]C. S. Iliopoulos, W. Rytter, "On Parallel Transformations of Suffix Arrays into Suffix Trees", in Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04). [bibtex]
[130]C. S. Iliopoulos, K. Pedikuri and H. Zhang, "Computing the regularities in biological weighted sequences", in String Algorithmics, C. S. Iliopoulos, T. Lecroq, Eds., 2004, pp. 109-128. [bibtex]
[129]C. S. Iliopoulos, K. Pedikuri and K. Tsihlas, "The Pattern Matching Problem in Biological Weighted Sequences", in Proc. of Third International Conference on Fun with Algorithms (FUN 2004), P. Feraggina, R. Grossi, Eds., pp. 106-117. [bibtex]
[128]C. S. Iliopoulos, M. Mohamed and W. F. Smyth, "New Complexity Results for the k-Covers Problem", in Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04). [bibtex]
[127]C. S. Iliopoulos, J. McHugh, P. Peterlongo, N. Pisanti, W. Rytter, M. Sagot, "A First Approach to Finding Common Motifs with Gaps", in Proceedings of the 2004 Prague Stringology Conference (PSC'04), M. Simanek, J. Jolub, Eds., pp. 88-97. [bibtex]
[126]C. S. Iliopoulos, C. Makris, Y. Panagis, E. Theodoridis, A. Tsakalidis, "Efficient Algorithms for Handling Molecular Weighted Sequences", IFIP Theoretical Computer Science, 2004, pp. 273-287. [bibtex]
[125]C. S. Iliopoulos, T. Lecroq, Eds., String Algorithmics, College Publications, 2004. [bibtex]
[124]M. Crochemore, C. S. Iliopoulos, M. Mohamed, M. Sagot, "Longest repeated motif with a block of don't cares", in 6th Latin American Theoretical INformatics (LATIN'04), M. Farach-Colton, Ed., Springer-Verlag, pp. 271-278. [bibtex]
[123]M. Christodoulakis, C. S. Iliopoulos, K. Perdikuri, K. Tsichlas, "Searching for Regularities in Weighted Sequences", in Lecture Series on Computer and Computational Sciences, T. Simos, G. Maroulis, Eds., 2004, pp. 701-704. [bibtex]
[122]R. Clifford, R. Groult, C. S. Iliopoulos, R. Byrd, "Music retrieval algorithms for the lead sheet problem", in Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04), G. Assayag, V. Cafagna, M. Chemillier, Eds., IRCAM, pp. 141-146. [bibtex]
[121]M. Christodoulakis, C. S. Iliopoulos, K. Park, J. S. Sim, "Implementing Approximate Regularities", Mathematical and Computer Modelling, vol. 42, no. 7, 2004, pp. 855-866. [bibtex]
[120]R. Clifford, C. S. Iliopoulos and K. Park, "Extending the Edit Distance for Musical Applications", in Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04), pp. 97-102. [bibtex]
[119]M. Christodoulakis, C. S. Iliopoulos, L. Mouchard, K. Tsichlas, "Pattern Matching on Weighted Sequences", in Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04), K. S. Guimaraes, M. Sagot, Eds., College publications, pp. 17-30. [bibtex]
[118]R. Clifford, C. S. Iliopoulos, "Approximate String Matching for Music Analysis", Soft Computing, vol. 8, 2004, pp. 597-603. [bibtex]
[117]R. Clifford, T. Crawford, C. S. Iliopoulos, D. Meredith, "Problems in Computational Musicology", in String Algorithmics, C. S. Iliopoulos, T. Lecroq, Eds., College Publications, 2004, pp. 1-17. [bibtex]
2003
[116]M. Christodoulakis, C. S. Iliopoulos, K. Park, J. S. Sim, "Implementing Approximate Regularities", in Proceedings of the International Conference on Computational Methods in Science and Engineering (ICCMSE2003), T. E. Simos, Ed., pp. 160-165. [bibtex]
[115]I. Lee, A. Apostolico, C. S. Iliopoulos, K. Park, "Finding Approximate Occurrences of a Pattern That Contains Gaps", in Proceedings 14--th Australasian Workshop on Combinatorial Algorithms, , Ed., SNU Press, 2003, pp. 89-100. [bibtex]
[114]M. Crochemore, C. S. Iliopoulos, G. Navarro, Y. Pinzon, "A Bit-parallel Suffix Automaton Approach for __MATH0__-Matching in Music Retrieval", in 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, M. A. Nascimento, E. S. d. Moura, A. L. Oliveira, Eds., Manaus, Brazil: Springer-Verlag, pp. 211-223. [bibtex]
[113]A. Apostolico, C. S. Iliopoulos and K. Park, "Truncated suffix trees", Theoretical Computer Science, vol. 304, 2003, pp. 87-101. [bibtex]
[112]C. S. Iliopoulos, M. Mohamed, L. Mouchard, K. Perdikuri, W. F. Smyth, A. Tsakalidis, "String Regularities with Don't Cares", Nordic Journal of Computing, vol. 10, no. 1, 2003, pp. 40-51. [bibtex]
[111]C. S. Iliopoulos, C. Makris, Y. Panagis, K. Perdikuri, E. Theodoridis, A. Tsakalidis, "Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees", in European Conference on Computational Biology, , Ed., 2003, pp. 539-540. [bibtex]
[110]R. Cole, C. S. Iliopoulos, T. Lecroq, W. Plandowski, W. Rytter, "On Special Families of Morphisms Related to delta-Matching and Don't Care Symbols", IPL, vol. 85, no. 5, 2003, pp. 227-233. [bibtex]
[109]C. S. Iliopoulos, L. Mouchard, K. Pedikuri, A. K. Tsakalidis, "Computing the Repetitions in a Weighted Sequence", in Proceedings of the 2003 Prague Stringology Conference (PSC'03), M. Simanek, Ed., pp. 91-98. [bibtex]
[108]R. Cole, C. S. Iliopoulos, M. Mohamed, W. F. Smyth, L. Yang, "Computing the Minimum k-Cover of a String", in Proceedings of the 2003 Prague Stringology Conference (PSC'03), M. Simanek, Ed., pp. 51-64. [bibtex]
[107]M. Christodoulakis, C. S. Iliopoulos, K. Park, J. S. Sim, "Approximate Seeds of Strings", in Proceedings of the 2003 Prague Stringology Conference (PSC'03), M. Simanek, Ed., pp. 25-36. [bibtex]
[106]D. Donovan, C. S. Iliopoulos, M. Miller, Eds., Special Issue of the Journal of Automata, Languages and Combinatorics, 2003. [bibtex] [pdf]
[105]C. S. Iliopoulos, T. Radzik, Eds., Combinatorial Algorithms, Elsevier, 2003. [bibtex]
[104]M. Crochemore, C. S. Iliopoulos and Y. J. Pinzon, "Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms", Fundamenta Informaticae, vol. 56, no. 1,2, 2003, pp. 89-103. [bibtex]
[103]M. Crochemore, C. S. Iliopoulos, T. Lecroq, Y. J. Pinzon, W. Plandowski, W. Rytter, "Occurrence and substring heuristics for __MATH0__-matching", Fundamenta Informaticae, vol. 56, no. 1,2, 2003, pp. 1-21. [bibtex]
2002
[102]C. S. Iliopoulos, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, "Identifying Occurrences of Maximal Pairs in Multiple Strings", in Proceedings of Combinatorial Pattern Matching (CPM'02), A. Apostolico, M. Takeda, Eds., Springer-Verlag, pp. 133-143. [bibtex]
[101]C. S. Iliopoulos, M. Kurokawa, "Exact and Approximate Distributed Matching for Musical Melodic Recognition", in Symposium on AI and Creativity in Arts and Science, Proceedings of AISB'02, G. Wiggins, Ed., The Society for the Study of Artificial Intelligence and Simulation of Behaviour, pp. 49-56. [bibtex]
[100]C. S. Iliopoulos, M. Mohamed, "Validation of Partially Occluded Images", in Proceedings 29--th Software Seminar (Sofsem 2002)---Theory and Practice of Informatics, , Ed., pp. 218-230. [bibtex]
[99]E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, Y. J. Pinzon, "Computing Approximate Repetitions in Musical Sequences", International Journal of Computer Mathematics, vol. 79, no. 11, 2002, pp. 1135-1148. [bibtex]
[98]C. S. Iliopoulos, M. Mohamed, L. Mouchard, K. Perikouri, W. F. Smyth, A. Tsakalidis, "String Regularities with Don't Cares", in Proceedings of the 2002 Prague Stringology Conference 2002 (PSC'02), M. Balik, M. Simanek, Eds., pp. 65-74. [bibtex]
[97]C. S. Iliopoulos, K. Lemstrom, M. Niyad, Y. J. Pinzon, "Evolution of Musical Motifs in Polyphonic Passages", in Symposium on AI and Creativity in Arts and Science, Proceedings of AISB'02, G. Wiggins, Ed., The Society for the Study of Artificial Intelligence and Simulation of Behaviour, pp. 67-76. [bibtex]
[96]C. S. Iliopoulos, M. Kurokawa, "Approximate matching with Gaps for Musical Melodic Recognition", in Proceedings of the 2002 Prague Stringology Conference (PSC'02), M. Balik, M. Simanek, Eds., pp. 55-64. [bibtex]
[95]A. Daskalopulu, C. S. Iliopoulos and M. Mohamed, "On-line Analysis and Validation of Partially Occluded Images: Implementation and Practice", International Journal of Computer Mathematics, vol. 79, no. 12, 2002, pp. 1245-1259. [bibtex]
[94]C. S. Iliopoulos, M. Miller, W. F. Smyth, Eds., Special Issue of the International Journal of Computer Mathematics, 2002. [bibtex]
[93]M. Crochemore, C. S. Iliopoulos, T. Lecroq, W. Plandowski, W. Rytter, "Three Heuristics for __MATH0__-Matching: __MATH0__-BM Algorithms", in Symposium on Combinatorial Pattern Matching (CPM'2002), A. Apostolico, M. Takeda, Eds., Springer-Verlag, pp. 178-189. [bibtex]
[92]E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, Y. J. Pinzon, "Algorithms for computing approximate repetitions in musical sequences", International Journal of Computer Mathematics, vol. 79, no. 11, 2002, pp. 1135-1148. [bibtex]
[91]M. Crochemore, C. S. Iliopoulos and Y. J. Pinzon, "Recovering an LCS in O__MATH0__ time and space", Colombian Journal of Computation, vol. 3, no. 1, 2002, pp. 41-52. [bibtex]
[90]M. Crochemore, C. S. Iliopoulos, C. Makris, W. Rytter, A. Tsakalidis, K. Tsichlas, "Approximate string matching with gaps", Nordic Journal of Computing, vol. 9, no. 1, 2002, pp. 54-65. [bibtex]
2001
[89]C. S. Iliopoulos, L. Mouchard and Y. J. Pinzon, "The max-shift algorithm for approximate string matching", in Proceedings of the 5th Workshop on Algorithm Engineering (WAE'01), G. S. Brodal, D. Friogioni, A. Marchetti-Spaccamela, Eds., Denmark: Springer-Verlag, pp. 13-25. [bibtex]
[88]C. S. Iliopoulos, J. Simpson, "On line validation and analysis of partially occluded images", Journal of Automata, Languages and Combinatorics, vol. 6, no. 3, 2001, pp. 291-303. [bibtex]
[87]C. S. Iliopoulos, J. F. Reid, "Decomposition of Partially Occluded Strings in the Presence of Errors", International Journal of Pattern Recognition and Artificial Intelligence, vol. 15, no. 7, 2001, pp. 1129-1142. [bibtex]
[86]J. Holub, C. S. Iliopoulos, B. Melichar, L. Mouchard, "Distributed pattern matching using finite Automata", Journal of Automata, Languages and Combinatorics, vol. 6, no. 2, 2001, pp. 191-204. [bibtex]
[85]T. Crawford, C. S. Iliopoulos, R. Winder, H. Yu, "Approximate musical evolution", Computers and the Humanities, vol. 35, no. 1, 2001, pp. 55-64. [bibtex]
[84]J. S. Sim, C. S. Iliopoulos, K. Park, W. F. Smyth, "Approximate periods of strings", Theoretical Computer Science, vol. 262, 2001, pp. 557-568. [bibtex]
[83]M. Crochemore, C. S. Iliopoulos, T. Lecroq, Y. J. Pinzon, "Approximate Repetitions in Musical Sequences", in Proceedings of Prague Stringology Club Workshop (PSCW' 01), M. Balik, M. Simanek, Eds., 2001, pp. 26-36. [bibtex]
[82]R. Cole, C. S. Iliopoulos, T. Lecroq, W. Plandowski, W. Rytter, "Relations between delta-matching and matching with don't care symbols: delta-distinguishing morphisms", in Proceedings 12--th Australasian Workshop on Combinatorial Algorithms, E. T. Baskoro, Ed., 2001, pp. 80-87. [bibtex]
[81]E. Cambouropoulos, T. Crawford and C. S. Iliopoulos, "Pattern processing in melodic sequences: challenges, caveats and prospects", Computers and the Humanities, vol. 35, no. 1, 2001, pp. 9-21. [bibtex]
[80]M. Crochemore, C. S. Iliopoulos and Y. J. Pinzon, "Speeding-up Hirschberg and Hunt-Szymanski Algorithms for the LCS Problem", in IEEE CS Proceedings, Symposium on String Processing and Information Retrieval (SPIRE01), , Ed., Laguna de San Rafael, Chile: IEEE Computer Society Press, 2001, pp. 59-67. [bibtex]
[79]C. S. Iliopoulos, Y. J. Pinzon, "Recovering an LCS in __MATH0__ time and space", in Proceedings of the 12th Australian Workshop on Combinatorial Algorithms (AWOCA'01), pp. 116-117. [bibtex]
[78]M. Crochemore, C. S. Iliopoulos and Y. J. Pinzon, "Computing Evolutionary Chains in Musical Sequences", Electronic Journal of Combinatorics, vol. 8, no. 2, 2001. [bibtex]
[77]M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, J. Reid, "A fast and practical bit-vector algorithms for the longest common subsequence problem", IPL, vol. 80, no. 6, 2001, pp. 279-285. [bibtex]
[76]M. Crochemore, C. S. Iliopoulos, C. Makris, W. Rytter, A. Tsakalidis, K. Tsichlas, "Approximate string matching with gaps", in Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, 2001, pp. 45-50. [bibtex]
2000
[75]C. S. Iliopoulos, M. Kumar, L. Mouchard, S. Venkatesh, "Motif Evolution in Polyphonic Musical Sequences", in Proceedings 11--th Australasian Workshop on Combinatorial Algorithms, L. Brankovic, J. Ryan, Eds., 2000, pp. 53-66. [bibtex]
[74]M. Crochemore, C. S. Iliopoulos and Y. Pinzon, "Fast evolutionary chains", in Proceedings of 27--th Software Seminar (SOFTSEM'00), K. J. V Hlavac, J. Wiedermann, Eds., pp. 371-380. [bibtex]
[73]C. S. Iliopoulos, J. F. Reid, "Optimal parallel analysis and decomposition of partially occluded strings", Parallel Computing, vol. 26, no. 4, 2000, pp. 483-494. [bibtex]
[72]C. S. Iliopoulos, J. F. Reid, "Decomposition of Partially Occluded Strings in the Presence of Errors", in Proc. of the 7th International Workshop on Combinatorial Image Analysis (IWCIA'2000), , Ed., pp. 227-239. [bibtex]
[71]C. S. Iliopoulos, T. Lecroq, L. Mouchard, Y. J. Pinzon, "Computing Approximate Repetitions in Musical Sequences", in Proceedings of Prague Stringology Club Workshop (PSCW' 00), M. Balik, M. Simanek, Eds., 2000, pp. 49-59. [bibtex]
[70]C. S. Iliopoulos, Ed., Special Issue of Theoretical Computer Science on Combinatorial Algorithms, 2000. [bibtex] [pdf]
[69]M. Crochemore, C. S. Iliopoulos, M. Korda, J. F. Reid, "A failure function for multiple two-dimensional pattern matching", Combinatorial Mathematics and Combinatorial Computing, vol. 35, 2000, pp. 225-238. [bibtex]
[68]M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, W. Rytter, "Finding Motifs with Gaps", in Proceedings of International Symposium on Music Information Retrieval (ISMIR'00), pp. 306-317. [bibtex]
[67]M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, J. Reid, "A fast and practical bit-vector algorithms for the longest common subsequence problem", in Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA'2000, L. Brankovic, J. Ryan, Eds., University of Newcastle, NSW, Australia, pp. 75-86. [bibtex]
1999
[66]E. Cambouropoulos, T. Crawford and C. S. Iliopoulos, "Pattern processing in melodic sequences: challenges, caveats and prospects", in Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB'99), G. Wiggins, Ed., pp. 42-47. [bibtex]
[65]C. S. Iliopoulos, L. Mouchard, "An $O(n\log n)$ algorithm for computing all maximal quasiperiodicities in strings", in Proceedings of Computing: Australasian Theory Symposium (CATS'99), , Ed., Auckland, New Zealand: Springer Verlag, pp. 262-272. [bibtex]
[64]J. S. Sim, C. S. Iliopoulos, K. Park, W. F. Smyth, "Approximate periods of strings", in Proceedings of 10--th Symposium on Combinatorial Pattern Matching, M. Crochemore, M. Paterson, Eds., Springer Verlag, 1999, pp. . [bibtex]
[63]E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, Y. J. Pinzon, "Algorithms for computing approximate repetitions in musical sequences", in Proceedings 10--th Australasian Workshop on Combinatorial Algorithms, J. Simpson, R. Raman, Eds., Curtin University Press, 1999, pp. 114-128. [bibtex]
[62]T. Crawford, C. S. Iliopoulos, R. Winder, H. Yu, "Approximate musical evolution", in Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB'99), G. Wiggins, Ed., pp. 76-81. [bibtex]
[61]C. S. Iliopoulos, L. Mouchard, "Quasiperiodicity: from detection to normal forms", Journal of Automata, Languages and Combinatorics, vol. 4, no. 3, 1999, pp. 213-228. [bibtex]
[60]J. Holub, C. S. Iliopoulos, B. Melichar, L. Mouchard, "Distributed Pattern Matching", in Proceedings 10--th Australasian Workshop on Combinatorial Algorithms, J. Simpson, R. Raman, Eds., Curtin University Press, 1999, pp. 129-145. [bibtex]
[59]C. S. Iliopoulos, L. Mouchard, "Quasiperiodicity and string covering", Theoretical Computer Science, vol. 218, no. 1, 1999, pp. 205-216. [bibtex]
[58]J. Holub, C. S. Iliopoulos, B. Melichar, L. Mouchard, "Distributed String Matching using Finite Automata", in Proceedings of the Tenth Australian Workshop on Combinatorial Algorithms, AWOCA'99 (Perth, 1999), R. Raman, J. Simpson, Eds., School of Computing, Curtin University of Technology, Perth, Western Australia, pp. 114-128. [bibtex]
1998
[57]C. S. Iliopoulos, L. Mouchard, "Fast Local Covers", Department of Computer Science, King's College London, Rep. TR-98-03, 1998. [bibtex]
[56]C. S. Iliopoulos, D. Moore and W. F. Smyth, "The covers of a circular Fibonacci string", Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 26, 1998, pp. 227-236. [bibtex]
[55]C. S. Iliopoulos, M. Korda, "Massively parallel construction of suffix arrays", in Proceedings of 25--th Software Seminar (SOFTSEM'98), E. Rovan, Ed., pp. 371-380. [bibtex]
[54]C. S. Iliopoulos, J. F. Reid, "Validating and decomposing partially occluded two-dimensional images", in Proceedings of the 1998 Prague Stringology Club Workshop (PSCW' 98), J. Holub, M. Simanek, Eds., pp. 83-94. [bibtex]
[53]T. Crawford, C. S. Iliopoulos and R. Raman, "String matching techniques for musical similarity and melodic recognition", Computing in Musicology, vol. 11, 1998, pp. 73-100. [bibtex]
[52]C. S. Iliopoulos, W. F. Smyth, "On line algorithms for __MATH0__-covering", in Proceedings of the 9--th Australasian Workshop on Combinatorial Algorithms, C. S. Iliopoulos, Ed., 1998, pp. 97-106. [bibtex]
[51]C. S. Iliopoulos, Ed., Proceedings of the 9--th Australasian Workshop on Combinatorial Algorithms, Curtin Press, 1998. [bibtex]
[50]M. Crochemore, C. S. Iliopoulos and H. Yu, "Algorithms for computing evolutionary chains in molecular and musical sequences", in Proceedings of the ninth Australian Workshop on Combinatorial Algorithms AWOCA'98 (Perth, 1998), C. S. Iliopoulos, Ed., School of Computing, Curtin University of Technology, Perth, Western Australia, pp. 172-184. [bibtex]
[49]M. Crochemore, C. S. Iliopoulos, M. Korda, J. F. Reid, "Two-dimensional dictionary prefix-matching", in Proceedings of the ninth Australian Workshop on Combinatorial Algorithms, AWOCA'98 (Perth, 1998), C. S. Iliopoulos, Ed., School of Computing, Curtin University of Technology, Perth, Western Australia, pp. 147-158. [bibtex]
[48]M. Crochemore, C. S. Iliopoulos and M. Korda, "Two-dimensional prefix string matching and covering on square matrices", Algorithmica, vol. 20, 1998, pp. 353-373. [bibtex]
[47]C. S. Iliopoulos, Ed., School of Computing, Curtin University of Technology, Perth, Western Australia, 1998. [bibtex]
1997
[46]C. S. Iliopoulos, J. Simpson, "On-line validation and analysis of Occluded Images", in Proceedings of the 8--th Australasian Workshop on Combinatorial Algorithms (AWOCA'97), , Ed., pp. 25-36. [bibtex]
[45]C. S. Iliopoulos, D. Moore and W. F. Smyth, "On the exact occurrences of squares in Fibonacci strings", Theoretical Computer Science, vol. 172, 1997, pp. 281-291. [bibtex]
[44]C. S. Iliopoulos, J. F. Reid, "An optimal parallel algorithm for analysing occluded images", in Proceedings of the 4--th Australasian Conference on Parallel and Real--Time systems (PART'97), N. Sharda, A. Tam, Eds., Springer Verlag, pp. 104-113. [bibtex]
1996
[43]C. S. Iliopoulos, K. Park, "An $O(\log \log n)$ PRAM Algorithm for computing all seeds of a string", Theoretical Computer Science, vol. 164, 1996, pp. 299-310. [bibtex]
[42]C. S. Iliopoulos, C. N. Galley, "On the lower bound for parallel string matching", International Journal of Computer Mathematics, vol. 62, no. 3--4, 1996, pp. . [bibtex]
[41]C. S. Iliopoulos, D. Moore and W. F. Smyth, "A linear algorithm for computing the squares of a Fibonacci string", in Proceedings of Computing: Australasian Theory Symposium (CATS'96), P. Eades, M. Moule, Eds., pp. 55-63. [bibtex]
[40]C. S. Iliopoulos, M. Korda, "Optimal parallel superprimitivity testing on square arrays", Parallel Processing Letters, vol. 6, no. 3, 1996, pp. 299-308. [bibtex]
[39]C. S. Iliopoulos, M. Korda, "Parallel two dimensional covering", in Proceedings of the 7--th Australasian Workshop on Combinatorial Algorithms (AWOCA'96), , Ed., pp. 62-75. [bibtex]
[38]C. S. Iliopoulos, D. W. G. Moore and K. Park, "Covering a string", Algorithmica, vol. 16, 1996, pp. 288-297. [bibtex]
[37]C. S. Iliopoulos, C. N. Galley, "A PRAM algorithm for a special case of the set partition problem", Journal of Parallel Algorithms and Applications, vol. 10, 1996, pp. 105-109. [bibtex]
1995
[36]O. Berkman, C. S. Iliopoulos and K. Park, "The subtree max gap problem with application to parallel string covering", Information and Computation, vol. 123, no. 1, 1995, pp. 127-137. [bibtex]
[35]C. S. Iliopoulos, W. F. Smyth, "A fast average case algorithm for Lyndon decomposition", International Journal of Computer Mathematics, vol. 57, 1995, pp. 15-31. [bibtex]
[34]C. S. Iliopoulos, "An optimal algorithm for prefix string matching and covering", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1995, pp. 227. [bibtex]
1994
[33]C. A. Farrell, D. H. Kieronska, C. S. Iliopoulos, M. Korda, "Performance implications of virtualization", in Proceedings of Western Australian Computer Science Symposium '94, , Ed., Perth W.A: UWA Press, pp. . [bibtex]
[32]C. S. Iliopoulos, C. N. Galley, "An $O(n\log n)$ cost single function partitioning problem", Parallel Processing Letters, vol. 4, no. 4, 1994, pp. 437-445. [bibtex]
[31]A. M. Ben-Amram, O. Berkman, C. S. Iliopoulos, K. Park, "The subtree max gap problem with application to parallel string covering", in Proceedings 5--th ACM--SIAM Symposium on Discrete Algorithms, , Ed., 1994, pp. 501-510. [bibtex]
[30]C. A. Farrell, D. H. Kieronska, C. S. Iliopoulos, M. Korda, "Performance implications of virtualization of massively parallel algorithm implementation", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1994, pp. 249. [bibtex]
[29]C. S. Iliopoulos, K. Park, "An optimal $O(\log \log n)$ time algorithm for parallel superprimitivity testing", Journal of the Korean Information Science Society, vol. 21, no. 8, 1994, pp. 1400-1404. [bibtex]
[28]J. W. Daykin, C. S. Iliopoulos and W. F. Smyth, "Parallel algorithms for factorizing strings over an ordered alphabet", Theoretical Computer Science, vol. 127, 1994, pp. 53-67. [bibtex]
1993
[27]C. S. Iliopoulos, C. Galley, "An $O(n\log n)$ cost single function partitioning problem", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1993, pp. 358. [bibtex]
[26]C. S. Iliopoulos, "Parallel algorithms for string pattern matching", in Lectures on Parallel Computation, A. Gibbons, P. Spyrakis, Eds., Cambridge Univ. Press, 1993, pp. 109-121. [bibtex]
[25]C. S. Iliopoulos, D. W. G. Moore and K. Park, "Covering a string", in Proceedings of the 4--th Symposium on Combinatorial Pattern Matching, , Ed., Berlin: Springer-Verlag, 1993, pp. 54-62. [bibtex]
1992
[24]C. S. Iliopoulos, W. F. Smyth, "An optimal parallel algorithm for computing the canonical form of a circular string", Theoretical Computer Science, vol. 92, 1992, pp. 87-105. [bibtex]
1991
[23]A. Apostolico, M. Farach and C. S. Iliopoulos, "Optimal superprimitivity testing for strings", IPL, vol. 39, 1991, pp. 17-20. [bibtex]
[22]C. S. Iliopoulos, D. W. G. Moore, "Algorithms for the general seed problem", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1991, pp. 310-311. [bibtex]
[21]J. W. Daykin, C. S. Iliopoulos and W. F. Smyth, "Parallel algorithms for factorizing strings over an ordered alphabet", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1991, pp. 309-310. [bibtex]
1990
[20]C. S. Iliopoulos, W. F. Smyth, "An optimal parallel algorithm for computing the canonical form of a circular string", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1990, pp. 258. [bibtex]
1989
[19]C. S. Iliopoulos, W. F. Smyth, "An optimal PRAM algorithm for identifying polygon similarity", in Optimal Algorithms, H. Djidjev, Ed., Springer Verlag, 1989, pp. 25-32. [bibtex]
[18]C. S. Iliopoulos, W. F. Smyth, "An optimal PRAM algorithm for identifying polygon similarity", in Proc. of International Symposium on Optimal Algorithms, , Ed., 1989, pp. 50-51. [bibtex]
[17]C. S. Iliopoulos, W. F. Smyth, "A comparison of three optimal algorithms for the canonization of circular strings", Journal of Combinatorial Information Science Systems, vol. 14, no. 2--3, 1989, pp. 59-72. [bibtex]
1988
[16]C. S. Iliopoulos, "Worst-case complexity bounds on algorithms for computing the structure of finite abelian groups and Hermite and Smith normal forms of an integer matrix", SIAM Journal Computing, vol. 18, 1988, pp. 131-141. [bibtex]
[15]A. Apostolico, C. S. Iliopoulos, "A parallel __MATH0__--time construction of suffix trees", Computer Science Technical Reports. Paper 549., 1988, pp. . [bibtex]
[14]C. S. Iliopoulos, "On the computational complexity of the abelian permutation group structure, membership and intersection problems", Theoretical Computer Science, vol. 56, 1988, pp. 211-222. [bibtex]
[13]A. Apostolico, C. S. Iliopoulos, G. Landau, B. Schieber, U. Vishkin, "Parallel construction of a suffix tree with applications", Algorithmica, vol. 3, 1988, pp. 347-365. [bibtex] [pdf]
1987
[12]A. Apostolico, C. S. Iliopoulos and R. Paige, "An $O(n \log n)$ cost parallel algorithm for the single function coarsest partition problem", in Mathematische Forschung, , Ed., 1987, pp. 70-76. [bibtex]
[11]A. Apostolico, C. S. Iliopoulos, "A parallel log time construction of suffix trees", in European Assoc. for Theor. Comp. Sc. Bulletin, , Ed., 1987, pp. 220-228. [bibtex]
[10]A. Apostolico, C. S. Iliopoulos and R. Paige, "On __MATH0__ Cost Parallel Algorithm for the Single Function Coarsest Partition Problem", in Parallel Algorithms and Architectures, A. Albrecht, H. Jung, K. Mehlhorn, Eds., Springer, 1987, pp. 70-76. [bibtex]
1986
[9]C. S. Iliopoulos, "Monte Carlo circuits for the abelian permutation group intersection problem", Acta Informatica, vol. 23, no. 3, 1986, pp. 697-705. [bibtex]
[8]C. S. Iliopoulos, "Worst-case analysis of algorithms for computational problems on abelian permutation groups", in SIGSAM Bulletin 20, , Ed., 1986, pp. 52. [bibtex]
1985
[7]C. S. Iliopoulos, "Gaussian elimination over an Euclidean ring", in Lecture Notes in Computer Science, , Ed., Springer Verlag, 1985, pp. 102-107. [bibtex]
[6]C. S. Iliopoulos, "Worst-case analysis of algorithms for computational problems on abelian permutation groups", in Lecture notes in Computer Science, , Ed., Springer Verlag, 1985, pp. 214-222. [bibtex]
[5]C. S. Iliopoulos, "Analysis of Algorithms on problems on general abelian groups", IPL, vol. 20, no. 4, 1985, pp. 215-220. [bibtex]
[4]W. M. Beynon, C. S. Iliopoulos, "Computing a basis for a finite abelian p-group", IPL, vol. 20, no. 3, 1985, pp. 161-163. [bibtex]
[3]C. S. Iliopoulos, "Computing on general abelian groups is hard", Theoretical Computer Science, vol. 41, no. 1, 1985, pp. 81-93. [bibtex]
1984
[2]C. S. Iliopoulos, "Improved worst-case complexity bounds on computations on abelian groups represented by a set of generators", in Proc. of International Congress of App. Math., , Ed., 1984, pp. 83-87. [bibtex]
1982
[1]C. S. Iliopoulos, "Analysis of an Algorithm for Composition of Binary Quadratic Forms", Journal of Algorithms, vol. 3, 1982, pp. 257-259. [bibtex]