Publications

Badkobeh et al., 2016. "Text redundancies".
In "Valerie Berthe and Michel Rigo", editor, "Combinatorics, Words and Symbolic Dynamics", pp "151--174".
Alatabbi et al., 2013. "Maximal Palindromic Factorization".
In "Jan Holub and Jan \vZ\vd\`arek", editor, "Proceedings of the Prague Stringology Conference 2013", pp "70--77", "Czech Technical University in Prague, Czech Republic".
Samiruzzaman & S. Iliopoulos", "2016". "Approximate circular pattern matching with a simple and light-weight filter-based algorithm".
"IEEE Transactions on NanoBioscience", . "(accepted)".
Pellegrini et al., "2016". "Repetitive structures in biological sequences: algorithms and applications".
"Frontiers".
Iliopoulos et al., "2016". "Searching And Indexing Circular Patterns".
In "", editor, "Algorithms for Next-Generation Sequencing", "Springer", pp "".
Iliopoulos et al., "2016". "Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis".
In "WALCOM: Algorithms in Bioinformatics", "Springer", pp "3--14".
Iliopoulos & Radoszewski", "2016". "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".
Crochemore et al., "2016". "Linear algorithm for conservative degenerate pattern matching ".
"Engineering Applications of Artificial Intelligence ", Volume "51", pp "109--114".
Brankovic et al., "2016". "Linear-time superbubble identification algorithm for genome assembly ".
"Theoretical Computer Science ", Volume "609, Part 2", pp "374 - 383".
Barton et al., "2016". "Transcriptome activity of isochores during pre-implantation process in human and mouse".
"FEBS Letters".
Barton et al., "2016". "Global Sequence Alignment with a Bounded Number of Gaps".
In "Mourad Elloumi and Costas S. Iliopoulos and Jason T. L. Wang and Albert Y. Zomaya", editor, "Pattern Recognition in Computational Molecular Biology: Techniques and Approaches", "Wiley", pp "83--96".
Aljamea et al., "2016". "Smart Meter Data Analysis".
In "International Conference on Internet of things and Cloud Computing (ICC 2016)", "ACM Digital Library", pp "22:1--22:6".
"Yannis Almirantis et al., "2016". "Optimal Computation of Avoided Words".
In "Workshop on Algorithms in Bioinformatics (WABI 2016)", "Springer", . "(accepted)".
"Vida Ghanaei, "2016". "Statistical Approach towards Malware Classification and Detection".
In "SAI Computing Conference 2016", . "(accepted)".
"Oluwole Ajala, Moudhi Aljamea, Mai Alzamel and Costas S. Iliopoulos", "2016". "A Novel Pattern Matching Approach for Fingerprint-based Authentication".
In "PATTERNS 2016", "IARIA", . "(accepted)".
"Moudhi Aljamea, "2016". "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".
"Costas S. Iliopoulos and Simon J. Puglisi", editor, "2016". "Dedicated to Professor William F. Smyth on the occasion of his 80th birthday".
Volume "", Issue "", "".
Crochemore et al., "2015". "The longest common substring problem".
"Mathematical Structures in Computer Science", Volume "FirstView", pp "1--19".
Athar et al., "2015". "Fast circular dictionary-matching algorithm".
"Mathematical Structures in Computer Science", Volume "FirstView", pp "1--14".
Grossi et al., "2015". "Circular Sequence Comparison with q-grams".
In "Pop, Mihai and Touzet, Helene", editor, "Algorithms in Bioinformatics", Volume "9289", "Springer Berlin Heidelberg", pp "203--216".
Ghanaei et al., "2015". "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".
Daykin et al., "2015". "Generic Algorithms for Factoring Strings".
"Information Theory, Combinatorics, and Search Theory 2013", pp "402--418".
Daykin et al., "2015". "Antimagicness of Generalized Corona and Snowflake Graphs".
"Mathematics in Computer Science", Volume "9", Issue "1", pp "105--111".
Crochemore et al., "2015". "Order-Preserving Indexing".
"Theoretical Computer Science", Volume "638", pp "122-135", . "in press".
Crochemore et al., "2015". "A note on the longest common compatible prefix problem for partial words".
"Journal of Discrete Algorithms", Volume "34", pp "49--53", . "http://dx.doi.org/10.1016/j.jda.2015.05.003".
Christodoulakis et al., "2015". "On the appearance of seeds in words".
"Journal of Combinatorial Mathematics and Combinatorial Computing", Volume "95", pp "147--160".
Barton et al., "2015". "Global and local sequence alignment with a bounded number of gaps".
"Theoretical Computer Science", Volume "582", pp "1--16".
Barton et al., "2015". "Average-Case Optimal Approximate Circular String Matching".
In "Language and Automata Theory and Applications - 9th International Conference Proceedings", pp "85--96".
Barton et al., "2015". "Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment".
In "Experimental Algorithms - 14th International Symposium, SEA 2015", pp "247--258".
Azim et al., "2015". "SimpLiFiCPM: A Simple and Lightweight Filter-based Algorithm for Circular Pattern Matching".
"International Journal of Genomics", . "in press".
Azim et al., "2015". "A Filter-Based Approach for Approximate Circular Pattern Matching".
In "Bioinformatics Research and Applications - 11th International Symposium", pp "24--35".
Aljamea et al., "2015". "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".
Alatabbi et al., "2015". "SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching".
In "Bioinformatics and Biomedical Engineering - Third International Conference", pp "219--230".
Alatabbi et al., "2015". "Algorithms for Longest Common Abelian Factors".
"CoRR", Volume "abs/1503.00049".
AlMansour & S. Iliopoulos", "2015". "Using Arabic Microblogs Features in Determining Credibility".
"Fab 2015", "Springer", pp "1212--1219".
Kim et al., "2014". "Order-preserving matching".
"Theoretical Computer Science", Volume "525", pp "68--79".
Iliopoulos & Mohamed", "2014". "On-line Minimum Closed Covers".
In "Artificial Intelligence Applications and Innovations 2014 Rhodes Greece September Proceedings", pp "106--115".
Ghanaei et al., "2014". "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".
Crochemore et al., "2014". "New simple efficient algorithms computing powers and runs in strings".
"Discrete Applied Mathematics", Volume "163, Part 3", Issue "0", pp "258 - 267".
Crochemore et al., "2014". "Extracting powers and periods in a word from its runs structure".
"Theoretical Computer Science", Volume "521", pp "29--41".
Crochemore et al., "2014". "Covering Problems for Partial Words and for Indeterminate Strings".
In "Algorithms and Computation - 25th International Symposium, ISAAC 2014 Jeonju Korea Proceedings", pp "220--232".
Christodoulakis et al., "2014". "On the average number of regularities in a word".
"Theoretical Computer Science", Volume "525", pp "3--9".
Christodoulakis et al., "2014". "Abelian borders in binary words".
"Discrete Applied Mathematics", Volume "171", pp "141--146".
Barton et al., "2014". "Optimal computation of all tandem repeats in a weighted sequence".
"Algorithms for Molecular Biology", Volume "9", pp "21".
Barton et al., "2014". "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".
Barton et al., "2014". "Fast algorithms for approximate circular string matching".
"Algorithms for Molecular Biology", Volume "9", pp "9".
Barton et al., "2014". "Extending alignments with k-mismatches and $-gaps ".
"Theoretical Computer Science", Volume "525", pp "80-88 ", . "".
Barton & S. Iliopoulos", "2014". "On the Average-case Complexity of Pattern Matching with Wildcards".
"CoRR", Volume "abs/1407.0950".
Barton & P. Pissis", "2014". "Optimal computation of all repetitions in a weighted string".
In "Costas S. Iliopoulos and Alessio Langiu", editor, "International Conference on Algorithms for Big Data (ICABD2014)", Issue "1146", pp "9-15", "Aachen".
Badkobeh et al., "2014". "Closed Factorization".
In "Proceedings of the Prague Stringology Conference 2014", pp "162--168".
Azim et al., "2014". "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".
AlMansour et al., "2014". "Evaluation of credibility assessment for microblogging: models and future directions".
In "14th International Conference on Knowledge Management and Data-driven I-KNOW 14, Graz, Austria, September 16-19, 2014", pp "32:1--32:4".
AlMansour et al., "2014". "A Model for Recalibrating Credibility in Different Contexts and Languages-A Twitter Case Study".
"International Journal of Digital Information and Wireless Communications (IJDIWC)", Volume "4", Issue "1", "The Society of Digital Information and Wireless Communication", pp "53--62".
Ahmed et al., "2014". "The swap matching problem revisited".
"Theoretical Computer Science", Volume "557", pp "34--49".
"Costas S. Iliopoulos and Alessio Langiu", editor, "2014". "Proceedings of the 2nd International Conference on Algorithms for Big Data, Palermo, Italy, April 07-09, 2014".
Volume "1146", "CEUR-WS.org".
Na et al., "2013". "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".
Kim et al., "2013". "Order Preserving Matching".
"Theoretical Computer Science", Volume "December".
Iliopoulos et al., "2013". "Telematics solution for the Teleco industry in the Developing.
In "Proceedings of the First International Conference on Green Computing, Technology and Innovation (ICGCTI 2013)", pp "14-20".
Iliopoulos & P. Pissis", "2013". "Verifying an enhanced cover array in linear time".
In "Stefan Gruner and Bruce Watson", editor, "Formal Aspects of Computing, Essays dedicated to Derrick Kourie on the occasion of his 65th birthday", "Shaker Verlag", pp "111 - 123".
Iliopoulos & P. Pissis", "2013". "Algorithms for next-generation sequencing data".
In "", editor, "Handbook of Biological Knowledge Discovery", "Wiley", pp "".
Frousios et al., "2013". "Transcriptome map of mouse isochores in embryonic and neonatal cortex".
"Genomics", Volume "101", Issue "2", pp "120--124".
Frousios et al., "2013". "Predicting the functional consequences of non-synonymous DNA sequence variants - evaluation of bioinformatics tools and development of a consensus strategy".
"Genomics", Volume "102", Issue "4", pp "223-231".
Flouri et al., "2013". "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", Volume "7(2)", "Bentham Science", pp "84-95".
Flouri et al., "2013". "Enhanced String Covering".
"Theoretical Computer Science", Volume "506", pp "102-114".
Elloumi et al., "2013". "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".
Crochemore et al., "2013". "Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes".
In "Kurland, Oren and Lewenstein, Moshe and Porat, Ely", editor, "String Processing and Information Retrieval", Volume "8214", "Springer International Publishing", pp "84-95".
Crochemore et al., "2013". "Computing the Longest Previous Factor".
"The Electronic Journal of Combinatorics", Volume "34", pp "15-26".
Christou et al., "2013". "Tree template matching in unranked ordered trees ".
"Journal of Discrete Algorithms", Volume "20", Issue "0", pp "51 - 60", . "StringMasters 2011 Special Issue ".
Christou et al., "2013". "Degree/diameter problem for trees and pseudotrees".
"AKCE International Journal of Graphs and Combinatorics", Volume "10(4)", pp "377-389".
Christodoulakis et al., "2013". "Overlapping factors in words".
"Australasian Journal of Combinatorics", Volume "57", "49--64".
Barton et al., "2013". "Querying Highly Similar Sequences".
"International Journal or Computation Biology and Drug Design", Volume "6", Issue "1-2", pp "119--130".
Barton et al., "2013". "GapsMis: Flexible Sequence Alignment with a Bounded Number of Gaps".
In "Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics", "ACM", pp "402:402--402:411", "New York, NY, USA".
Barton et al., "2013". "Circular string matching revisited".
In "Proceedings of the Fourteenth Italian Conference on Theoretical Computer Science (ICTCS 2013)", pp "200-205".
"Moudhi Aljamea, Vida Ghanaei, Costas S. Iliopoulos and Richard Overill", "2013". "Static Analysis and Clustering of Malware Applying Text Based Search".
In "The International Conference on Digital Information Processing, E-Business and Cloud Computing", "SDIWC", pp "188--193".
"Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Jakub Pachocki and Jakub Radoszewski and Wojciech Rytter and Wojciech Tycznski, "2013". "A note on efficient computation of all Abelian periods in a string".
"Inf. Process. Lett.", Volume "113", Issue "3", pp "74--77".
"Carl Barton, Costas S. Iliopoulos, Nicola Mulder and Bruce Watson", "2013". "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".
"Ali Alatabbi, "2013". "Malware Detection using Computational Biology Tools".
"International Journal of Engineering and Technology", pp "315".
Zhang et al., "2012". "Locating Tandem Repeats in Weighted Biological Sequences".
In "De-Shuang Huang and Phalguni Gupta and Xiang Zhang and Prashan Premaratne", editor, "ICIC (3)", Volume "304", "Springer", pp "118-123".
Zhang et al., "2012". "Computing the Minimum lambda-Cover in Weighted Sequences".
In "De-Shuang Huang and Changjun Jiang and Vitoantonio Bevilacqua and Juan Carlos Figueroa Garcia", editor, "ICIC (1)", Volume "7389", "Springer", pp "120--127".
Iliopoulos et al., "2012". "Parallel algorithms for mapping short degenerate and weighted sequences to a reference genome".
"International Journal of Foundations of Computer Science", Volume "23", Issue "2", pp "249--259".
Iliopoulos et al., "2012". "Exact and approximate rhythm matching algorithms".
"International Journal on Digital Libraries", Volume "12", "Springer", pp "149--158".
Hadjinikolis et al., "2012". "Minimising processor communication in parallel approximate string matching".
"Technical Reports", Issue "Exelixis-RRDR-2012-8".
Flouri et al., "2012". "Tree template matching in ranked ordered trees by pushdown automata".
"Journal of Discrete Algorithms", Volume "17", pp "15--23".
Flouri et al., "2012". "New and efficient approaches to the quasiperiodic characterisation of a string".
In "Proceedings of the Prague Stringology Conference (PSC 2012)", pp "75--88".
Flouri et al., "2012". "Mapping short reads to a genomic sequence with circular structure".
"International Journal of Systems Biology and Biomedical Technologies", Volume "1", Issue "1", "IGI Global", pp "26--34".
Flour et al., "2012". "GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures".
In "Iliadis, Lazaros and Maglogiannis, Ilias and Papadopoulos, Harris and Karatzas, Kostas and Sioutas, Spyros", editor, "Artificial Intelligence Applications and Innovations", Volume "382", "Springer Berlin Heidelberg", pp "593--601".
Elloumi et al., "2012". "Detection of fixed length web spambot using REAL (read aligner)".
In "Proceedings of the CUBE International Information Technology Conference", "ACM", pp "820--825".
Crochemore et al., "2012". "The Maximum Number of Squares in a Tree".
In "Juha Kärkkäinen and Jens Stoye", editor, "CPM", Volume "7354", "Springer", pp "27--40".
Crochemore et al., "2012". "Improved Algorithms for the Range Next Value Problem and Applications".
"Theoretical Computer Science", Volume "434", "Elsevier", pp "23--34".
Crochemore et al., "2012". "Efficient algorithms for three variants of the LPF table".
"Journal of Discrete Algorithms", Volume "11", pp "51--61".
Christou et al., "2012". "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".
Christou et al., "2012". "On left and right seeds of a string".
"Journal of Discrete Algorithms", Volume "17", "Elsevier", pp "31--44".
Christou et al., "2012". "Identifying All Abelian Periods Of A String In Quadratic Time And Relevant Problems".
"International Journal of foundations of Computer Science", Volume "23", Issue "6", pp "1371--1384".
Christou et al., "2012". "Efficient seed computation revisited".
"Theoretical Computer Science".
Christou et al., "2012". "Computing all subtree repeats in ordered trees".
"Information Processing Letters", Volume "112", Issue "24", pp "958--962".
Chang et al., "2012". "Conceptualization, Significance Study Of a New Application CS-MIR".
In "Iliadis, Lazaros and Maglogiannis, Ilias and Papadopoulos, Harris and Karatzas, Kostas and Sioutas, Spyros", editor, "Artificial Intelligence Applications and Innovations", Volume "381", "Springer Berlin Heidelberg", pp "146--156".
Chan et al., "2012". "Exact and approximate rhythm matching algorithms".
"International Journal on Digital Libraries", Volume "12", Issue "2-3", "Springer-Verlag", pp "149--158", "Berlin, Heidelberg".
Barton et al., "2012". "Melodic String Matching via Interval Consolidation and Fragmentation".
In "Artificial Intelligence Applications and Innovations", Volume "382", pp "460-469".
Alatabbi et al., "2012". "Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations".
In "Iliadis, Lazaros and Maglogiannis, Ilias and Papadopoulos, Harris and Karatzas, Kostas and Sioutas, Spyros", editor, "Artificial Intelligence Applications and Innovations", Volume "382", "Springer Berlin Heidelberg", pp "584--592".
Alatabbi et al., "2012". "Overlapping Repetitions in Weighted Sequence".
In "Proceedings of the CUBE International Information Technology Conference", pp "435--440".
Alatabbi et al., "2012". "On the repetitive collection indexing problem".
"2012 IEEE International Conference on Bioinformatics and Workshops", Volume "0", "IEEE Computer Society", pp "682-687", "Los Alamitos, CA, USA".
Alatabbi & S. Iliopoulos", "2012". "Morphological Anlysis and generation for arabic language".
"International Journal of Wireless Information Networks & Information System", Volume "May/June".
Phanalasy et al., "2011". "Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs".
"Mathematics in Computer Science", Volume "5", Issue "1", Springer, pp "81--87".
Iliopoulos et al., "2011". "New Complexity Results for the k-Covers Problem".
"International Journal of Information Sciences", Volume "181", "Elsevier", pp "2571--2575".
Iliopoulos et al., "2011". "An algorithm for mapping short reads to a dynamically changing genomic sequence".
"Journal of Discrete Algorithms", Volume "10", "Elsevier", pp "15--22".
Flouri et al., "2011". "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", pp "273--281".
Flouri et al., "2011". "Tree Indexing by Pushdown Automata and Repeats of Subtrees".
In "FedCSIS", pp "899-902".
Flouri et al., "2011". "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".
Flouri et al., "2011". "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".
Crochemore et al., "2011". "On the Maximal Number of Cubic Runs in a String".
"Journal of Computer and System Sciences", "Elsevier", . "(in press)".
Christou et al., "2011". "On the right-seed array of a string".
In "Proceedings of the 17th Annual International Conference on Computing and Combinatorics", "Springer-Verlag", pp "492--502".
Christou et al., "2011". "Efficient seed computation revisited".
In "Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)", Volume "6661", "Springer", pp "350--363".
Christou et al., "2011". "Computing All Subtree Repeats in Ordered Ranked Trees".
In "Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri", editor, "String Processing and Information Retrieval", Volume "7024", "Springer Berlin / Heidelberg", pp "338--343".
Arhondakis et al., "2011". "Transcriptome map of mouse isochores".
"BMC Genomics", Volume "12", Issue "1", pp "511".
"Costas S. Iliopoulos and William F. Smyth", editor, "2011". "Combinatorial Algorithms - 21st International Workshop, IWOCA.
In "IWOCA", Volume "6460", "Springer".
Chang et al., "2010". "Sub-nyquist audio fingerprinting for music recognition".
In "Computer Science and Electronic Engineering Conference (CEEC), 2010 2nd", pp "1--5".
Albrecht et al., "2010". "A Note on a priori Estimations of Classification Circuit Complexity ".
"Fundamenta Informaticae", Volume "104", Issue "3", pp "201--217".
manolis # and # csi, "2010". "Advances in Combinatorial Algorithms II".
"Special issue of Mathematics in Computer Science", Volume "3", Issue "4", "Birkhauser/Springer".
csi # and # laurent # and # solon, "2010". "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)", Volume "19", "IOS Press", pp "150--157".
Zhang et al., "2010". "Varieties of Regularities in Weighted Sequences".
In "Bo Chen", editor, "Algorithmic Aspects in Information and Management", Volume "6124", "Springer Berlin / Heidelberg", pp "271--280".
Zhang et al., "2010". "Loose and Strict Repeats in Weighted Sequences of Proteins".
"Protein and Peptide Letters", Volume "17", Issue "9", "Bentham Science Publishers", pp "1136-1142".
Zhang et al., "2010". "An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences".
In "Tiziana Calamoneri and Josep Diaz", editor, "Algorithms and Complexity", Volume "6078", "Springer Berlin / Heidelberg", pp "335--346".
Iliopoulos et al., "2010". "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)", . "10.1109/ITAB.2010.5687792".
Iliopoulos et al., "2010". "Finite Automata Based Algorithms on Subsequences and Supersequences of Degenerate Strings".
"Journal of Discrete Algorithms", Volume "8", Issue "2", pp "118--130".
Iliopoulos & Michalakopoulos", "2010". "Combinatorial ECG analysis for mobile devices".
In "Proceedings of the international conference on Multimedia information retrieval", "ACM", pp "409--412", "New York, NY, USA".
Iliopoulos & Michalakopoulos", "2010". "A Combinatorial Model for ECG Interpretation".
"International Journal of Biological and Life Sciences", Volume "2", Issue "1", "World Academy of Science, Engineering and Technology", pp "10 -- 15".
Frousios et al., "2010". "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".
Flouri et al., "2010". "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".
Crochemore et al., "2010". "On the Maximal Number of Cubic Runs in a String".
In "Adrian-Horia Dediu and Henning Fernau and Carlos Mart\`in-Vide", editor, "Language and Automata Theory and Applications", Volume "6031", "Springer Berlin / Heidelberg", pp "227--238".
Crochemore et al., "2010". "Number of Occurrences of powers in Strings".
"Int. J. Found. Comput. Sci.", Volume "21", Issue "4", pp "535--547".
Crochemore et al., "2010". "Finding patterns in given intervals".
"Fundamenta Informaticae", Volume "101", "IOS Press", pp "1--14".
Crochemore et al., "2010". "Extracting powers and periods in a string from its runs structure".
In "Proceedings of the 17th international conference on String processing and information retrieval", "Springer-Verlag", pp "258--269", "Berlin, Heidelberg".
Crochemore et al., "2010". "Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays".
In "Jan van Leeuwen and Anca Muscholl and David Peleg and Jaroslav Pokorn\`y and Bernhard Rumpe", editor, "SOFSEM 2010: Theory and Practice of Computer Science", Volume "5901", "Springer Berlin / Heidelberg", pp "296--307".
Crochemore et al., "2010". "Cover array string reconstruction".
In "Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010)", Volume "6129", "Springer", pp "251--259".
Crochemore et al., "2010". "Algorithms for three versions of the shortest common superstring problem".
In "Proceedings of the 21st Annual Conference on Combinatorial pattern matching", "Springer-Verlag", pp "299--309", "Berlin, Heidelberg".
Crochemore et al., "2010". "A Parallel Algorithm for Fixed-length Approximate String Matching with k-mismatches".
"Algorithms and Applications", Volume "6060", "Springer-Verlag", pp "92-101".
Christodoulakis & S. Iliopoulos", "2010". "Recent Advances in Weighted DNA Sequences".
In "Mourad Elloumi and Albert Y. Zomaya", editor, "Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications", "Wiley", pp "143--167".
Chan et al., "2010". "Music genre classification via compressive sampling".
In "J. Stephen Downie and Remco C. Veltkamp", editor, "Proceedings of the Eleventh International Society for Music Information Retrieval Conference (ISMIR 2010)", pp "387--392".
Antoniou et al., "2010". "Algorithms for mapping short degenerate and weighted sequences to a reference genome".
"Internation Journal of Computational Biology and Drug Design", Volume "2", Issue "4", pp "385--397".
Antoniou et al., "2010". "A Fast and Efficient Algorithm for Mapping Short Sequences to a Reference Genome".
In "Hamid R. Arabnia", editor, "Advances in Computational Biology", Volume "680", "Springer New York", pp "399--403".
Antoniou & S. Iliopoulos", "2010". "New developments in processing of degenerate sequences".
In "Mourad Elloumi and Albert Y. Zomaya", editor, "Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications", "Wiley", pp "73--89".
Allali et al., "2010". "Combinatorial detection of arrhythmia".
In "Proceedings of the 3rd International Conference on Bio-inspired Systems and Signal Processing (BIOSIGNALS 2010)", pp "180--187".
pavlos # and # csi # and # laurent # and # solon, "2009". "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".
csi # and # spiros, "2009". "A Combinatorial Model for ECG Interpretation".
In "Cemal Ardil", editor, "Proceedings of the International Conference on Medical Informatics and Biomedical Engineering (ICMIBE 2009)", "World Academy of Science, Engineering and Technology", pp "451--456".
csi # and # smyth # and # "Munina Yusufu", "2009". "Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences".
"Fundamenta Informaticae", Volume "", pp "", . "(in press)".
csi # and # "Mirka Miller" # and # solon, "2009". "Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies".
In "Jan Holub and Jan Zdarek", editor, "Proceedings of the Prague Stringology Conference (PSC 2009)", pp "249--262".
Iliopoulos et al., "2009". "On Diregularity of Digraphs of Defect at Most Two".
JCMCC, Volume "71", pp "21--38".
Iliopoulos et al., "2009". "Algorithms for two versions of LCS problem for indeterminate strings".
"Journal of Combinatorial Mathematics and Combinatorial Computing", Volume "71", pp "155--172".
Crochemore et al., "2009". "On the maximal number of highly periodic runs in a string".
"CoRR", Volume "abs/0907.2157".
Crochemore et al., "2009". "LPF computation revisited".
In "J. Fiala and J. Kratochvil and M. Miller", editor, "Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA 2009)", Volume "5874", "Springer", pp "158--169".
Crochemore et al., "2009". "Bounds on powers in strings".
In "Ito, Masami and Toyama, Masafumi", editor, "International Conference on Developments in Language Theory (DLT`09)", Volume "5257", "Springer-Verlag", pp "206--215".
Ardila et al., "2009". "Efficient ($\delta$, $\gamma$)-pattern-matching with don`t cares".
"Journal of Combinatorial Mathematics and Combinatorial Computing", Volume "70", Issue "", pp "221--234".
Antoniou et al., "2009". "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)".
Allali et al., "2009". "Toward a General Framework for Polyphonic Comparison".
"Fundamenta Informaticae", Volume "97", Issue "3", pp "331--346".
"Costas S. Iliopoulos and Wojciech Rytter", editor, "2009". "String Algorithms: Dedicated to Professor Maxime Crochemore on the occasion of his 60th birthday".
Volume "", Issue "", " Elsevier", "".
"Julien Allali" # and # pavlos # and # csi # and # "Pascal Ferraro" # and # "Manal Mohamed", "2009". "Validation and Decomposition of Partially Occluded Images with Holes".
In "Jan Holub and Jan Zdarek", editor, "Proceedings of the Prague Stringology Conference (PSC 2009)", pp "129--136".
"Julien Allali" # and # pavlos # and # "Pascal Ferraro" # and # csi # and # spiros, "2009". "Overlay Problems for Music and Combinatorics".
In "Mitsuko Aramaki and Richard Kronland-Martinet and Solvi Ystad and Kristoffer Jensen", editor, "Proceedings of the International Conference on Auditory Display / Computer Music Modeling and Retrieval (ICAD/CMMR 2009)", "Re:New - Digital Arts Forum".
Iliopoulos & Sohel Rahman", "2008". "Indexing Circular Patterns".
In "Proceedings of the Workshop on Algorithms and Computation", pp "46--57", "Dhaka, Bangladesh".
Iliopoulos & Sohel Rahman", "2008". "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", "High Tatras, Slovakia".
Chan et al., "2008". "Erratic Dancing".
In "Kristoffer Jensen", editor, "Proceedings of the 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008)", "Re:New - Digital Arts Forum", pp "117--129", "Copenhagen, Denmark".
Antoniou et al., "2008". "Conservative string covering of indeterminate strings".
In " Jan Holub and Jan Zdarek", editor, "Proceedings of the 13th Prague Stringology Conference (PSC 2008)", "Czech Technical University", pp "108-115", "Prague, Czech Republic".
Antoniou et al., "2008". "Computing Repetitive Structures in Indeterminate Strings".
In "Proceedings of the 3rd IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB 2008) ", "Melbourne, Australia". "(Poster Paper)".
Zhang et al., "2008". "Generalized approximate regularities in strings".
"International Journal of Computer Mathematics", Volume "85", Issue "2", pp "155--168".
Zhang et al., "2008". "Algorithms for Computing the $\lambda$-regularities in Strings".
"Fundamenta Informaticae", Volume "84", Issue "1", pp "33-49".
Roh et al., "2008". "External memory algorithms for string problems".
"Fundamenta Informaticae", Volume "84", pp "1--16".
Iliopoulos et al., "2008". "A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching".
"Mathematics in Computer Science", Volume "1", Issue "4", pp "557--569".
Iliopoulos & Sohel Rahman", "2008". "New efficient algorithms for the LCS and constrained LCS problems".
"Information Processing Letters", Volume "106", Issue "1", pp "13--18".
Iliopoulos & Sohel Rahman", "2008". "Faster index for property matching".
"Information Processing Letters", Volume "105", Issue "6", pp "218--223".
Iliopoulos & Sohel Rahman", "2008". "Algorithms for computing variants of the longest common subsequence problem".
"Theoretical Computer Science", Volume "395", Issue "2-3", pp "255--267".
Iliopoulos & Miller", "2008". "Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia".
"Journal of Discrete Algorithms", Volume "6", Issue "1", pp "1--2".
Flouri et al., "2008". "Indexing Factors in DNA/RNA Sequences".
In "Bioinformatics Research and Development", pp "436-445".
Crochemore et al., "2008". "Optimal prefix and suffix queries on texts".
"Information Processing Letters", Volume "108", Issue "5", "Elsevier North-Holland, Inc.", pp "320--325", "Amsterdam, The Netherlands".
Crochemore et al., "2008". "Improved algorithms for the range next value problem and applications".
In "S. Albers and P. Weil", editor, "International Symposium on Theoretical Aspects of Computer Science (STACS`08)", "IBFI Schloss Dagstuhl", pp "205--216".
Clifford et al., "2008". "Necklace Swap Problem for Rhythmic Similarity Measures".
"International Journal of Computational Methods", Volume "5", Issue "3", pp "351--363".
Christodoulakis et al., "2008". "Identifying Rhythms in Musical Texts".
"International Journal of Foundations of Computer Science", Volume "19", Issue "1", pp "37--51".
Antoniou et al., "2008". "Implementation of a Swap Matching Algorithm Using a Graph Model".
In "Bioinformatics Research and Development", pp "446-455".
Amir et al., "2008". "Property matching and weighted matching".
"Theor. Comput. Sci.", Volume "395", Issue "2-3", pp "298-310".
Rahman et al., "2007". "Pattern Matching in Degenerate DNA/RNA Sequences".
In "M. Kaykobad and Md. Saidur Rahman", editor, "Proceedings of the Workshop on Algorithms and Computation", "Bangladesh Academy of Sciences", pp "109--120", "Dhaka, Bangladesh".
Rahman & S. Iliopoulos", "2007". "Pattern Matching Algorithms with Don`t Cares".
In "Jan van Leeuwen and F. Italiano and van der Hoek and Meinel and Sack and Plasil and Bielikova", editor, "Proceedings of the 33rd International Conference on Current Trends in Theory and of Computer Science (SOFSEM07)", Volume "", Issue "", "Institute of Computer Science AS CR, Prague", pp "116-126", "".
Rahman & S. Iliopoulos", "2007". "Indexing Factors with Gaps".
In "Jan van Leeuwen and Giuseppe F. Italiano and Wiebe van der Hoek and Christoph Meinel and Harald Sack and Frantisek Plasil", editor, "Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)", Volume "4362", "Springer", pp "465-474", "Harrachov, Czech Republic".
Rahman & S. Iliopoulos", "2007". "A New Efficient Algorithm for computing the Longest Common Subsequence".
In "M. Y. Kao and X. Y. Li", editor, "Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management ", Volume "4508", "Springer", pp "82--90", "Portland, USA".
Iliopoulos et al., "2007". "Weighted degenerated approximate pattern matching".
In "R. Loos and S. Z. Fazekas and C. Martin-Vide", editor, "Proceedings of the 1st International Conference on Language and Automata Theory and Applications", pp "285--296", "Tarragona, Spain".
Iliopoulos et al., "2007". "Transformation of Suffix Arrays into Suffix Trees on the MPI Environment".
In "Aijun An and Jerzy Stefanowski and Sheela Ramanna and Cory J. Butz and Witold Pedrycz and Guoyin Wang", editor, "Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing (RSFDGrC 07)", Volume "4482", "Springer", pp "248-255", "Toronto, Canada".
Iliopoulos et al., "2007". "The Constrained Longest Common Subsequence Problem for Degenerate Strings".
In "J. Holub and J. Zdarek", editor, "Proceedings of the 12th International Conference on Implementation and Application of Automata", Volume "4783", "Springer", pp "309-311", "Prague, Czech Republic".
Iliopoulos et al., "2007". "On diregularity of digraphs of defect two".
In "L. Brankovich and Y. Lin and W. F. Smyth", editor, "International Workshop on Combinatorial Algorithms (IWOCA)", pp "25--34", "Newcastle, Australia".
Iliopoulos et al., "2007". "Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata".
In "H. Broesma and S. Dantcher, M. Jhonson and S. Szeider", editor, "Proceedings of the 3rd Algorithms and Complexity in Durham Workshop", Volume "9", pp "95--106", "Durham, UK".
Iliopoulos et al., "2007". "Algorithms for Computing the Longest Parameterized Common Subsequence".
In "B. Ma and Z. Zhang", editor, "Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching", Volume "4580", "Springer", pp "265-273", "Ontario, Canada".
Iliopoulos & Sohel Rahman", "2007". "New Efficient Algorithms for LCS and Constrained LCS Problem".
In "Hajo Broersma and Stefan Dantchev and Matthew Johnson and Stefan Szeider", editor, "Proceedings of the 3rd Algorithms and Complexity in Durham Workshop", Volume "9", "College Publications London", pp "83--94", "Durham, UK".
Chen et al., "2007". "Implementation of Algorithms to Classify Musical Texts According to Rhythms".
In "Charalampos Spyridis and Anastasia Georgaki and Georgios Kouroupetroglou and Christina Anagnostopoulou", editor, "Proceedings of the 4th Sound and Music Computing Conference (SMC `07)", "National and Kapodistrian University of Athens", pp "134--141", "Lefkada, Greece".
Allali et al., "2007". "Local Transpositions in Alignment of Polyphonic Musical Sequences".
In "Proceedings of the 14th String Processing and Information Symposium", Volume "4726", "Springer", pp "26-38", "Santiago, Chile".
Lee et al., "2007". "Linear time algorithm for the longest common repeat problem".
JDA, Volume "5", Issue "2", pp "243-249".
Iliopoulos et al., "2007". "Algorithms for extracting motifs from biological weighted sequences".
JDA, Volume "5", Issue "2", pp "229-242".
Iliopoulos & Sohel Rahman", "2007". "Indexing Factors with Gaps".
Alg, Volume "55", Issue "1", pp "60-70".
Iliopoulos & Sohel Rahman", "2007". "A New Efficient Algorithm for Computing the Longest Common Subsequence".
"Theory of Computing Systems", Volume "45", Issue "2", pp "355-371".
Guo et al., "2007". "Computing the $\lambda$-covers of a string".
"Inf. Sci.", Volume "177", Issue "19", pp "3957-3967".
Crochemore et al., "2007". "Finding Patterns in Given Intervals".
In "Kucera, L. and Kucera, A.", editor, " Mathematical Foundations of Computer Science (MFCS`07)", Volume "4708", "Springer-Verlag, Berlin", pp "645--656".
Cambouropoulos et al., "2007". "All maximal-pairs in step-leap representation of melodic sequence".
"Inf. Sci.", Volume "177", Issue "9", pp "1954-1962".
Bakalis et al., "2007". "Locating Maximal Multirepeats in Multiple Strings Under Various Constraints".
"The Computer Journal", Volume "50", Issue "2", pp "178--185".
Ardila et al., "2007". "Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences".
"Journal of Computational Biology", Volume "14", Issue "7", pp "1001 -- 1010".
Antoniou et al., "2007". "Application of suffix trees for the acquisition of common motifs with gaps in a set of strings".
In "R. Loos and S. Z. Fazekas and C. Martin-Vide", editor, "1st International Conference on Language and Automata Theory and Applications (LATA`07)", "Universitat Rovira i Virgili", pp "57--66".
Albrecht et al., "2007". "A Priori Estimation of Classification Circut Complexity".
In "J. Daykin and M. Mohamed and K. Steinhofel", editor, "London Algorithmics and Stringology", Volume "8", "College Publications", pp "97--114".
Zhang et al., "2006". "Computing the $\lambda$-Seeds of a String".
In "Siu-Wing Cheng and Chung Keung Poon", editor, "Proc. of the Second International Conference on Algorithmic Aspects in Information and Management (AAIM `06)", Volume "4041", Issue "32", "Springer", pp "303-313", "Hong Kong, China".
Rahman et al., "2006". "Finding Patterns with Variable Length Gaps or Don`t Cares".
In "Danny Z. Chen and D. T. Lee", editor, "Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON`06)", Volume "4112", "Springer", pp "146-155", "Taipei, Taiwan".
Iliopoulos et al., "2006". "Fast practical exact and approximate pattern matching in protein sequences".
In "J. Ryan and Dafik", editor, "Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms", Volume "", "", pp "", "Central Australia".
Iliopoulos & Sohel Rahman", "2006". "Algorithms for Computing Variants of the Longest Common Subsequence Problem".
In "T. Asano", editor, "Proceedings of the 17th International Symposium on Algorithms and Computation", Volume "", Issue "4288", "Springer", pp "399-408", "Kolkata, India". "".
Crochemore et al., "2006". "External Memory Algorithms for String Problems".
In "J. Ryan and Dafik", editor, "Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms", Volume "", "", pp "", " Australia".
Christodoulakis et al., "2006". "Song Classifications for Dancing".
In "Jan Holub and Jan Zdarek", editor, "Proceedings of the 11th Prague Stringology Conference", Volume "", "Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University", pp "41-48", "Czech Republic".
Bakalis et al., "2006". "Algorithms for Bitmasking Strings".
In "Theodore Simos and George Maroulis", editor, "Proceedings of International Conference of Computational Methods in Sciences and Engineering", Volume "", Issue "", "", pp "1061-1063", "Crete, Greece". "".
Antoniou et al., "2006". "Finding Common Motifs with Gaps using Finite Automata".
In "Oscar H. Ibarra and Hsu-Chun Yen", editor, "Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA`06)", Volume "4094", "Springer Berlin / Heidelberg", pp "69--77", "Taipei, Taiwan".
Amir et al., "2006". "Approximate matching in weighted sequences".
In "Moshe Lewenstein and Gabriel Valiente", editor, "Proc. of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06)", Volume "4009", Issue "", "Springer Berlin / Heidelberg", pp "365--376", "Barcelona, Spain".
Zhang et al., "2006". "Computing the minimum approximate $\lambda$ -cover of a string".
In "Fabio Crestani and Paolo Ferragina and Mark Sanderson", editor, "Proceedings of the 13th Symposium on String Processing and Information Retrieval", Volume "4209", "Springer", pp "49-60".
Iliopoulos et al., "2006". "The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications".
FI, Volume "71", Issue "2-3", pp "259--277".
Crochemore et al., "2006". "Longest Repeats with a Block of $k$ Don`t Cares".
TCS, Volume "362", Issue "1-3", pp "248--254".
Christodoulakis et al., "2006". "Simple Algorithm for Sorting All the Fibonacci String Rotations".
In "J. Wiedermann and J. Stuller and G. Tel and J. Pokorny and M Bielikova", editor, "Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)", Volume "3831", "Springer-Verlag", pp "218--225".
Christodoulakis et al., "2006". "Computation of Repetitions and Regularities of Biological Weighted Sequences".
"Journal of Computational Biology", Volume "13", Issue "6", pp "1214--1231".
Ardila et al., "2006". "Simple Algorithm for sorting the Fibonacci string rotations".
"International Journal of Pure and Applied Mathematics", Volume "31", Issue "1", "Springer", pp "97 -- 107".
"Costas S. Iliopoulos and Kunsoo Park and Kathleen Steinhöfel", editor, "2006". "Algorithms in Bioinformatics".
Volume "6", Issue "", "College Publications", "".
Pickens & S. Iliopoulos", "2005". "Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval".
In "Proceedings of the 6th International Conference on Music Information Retrieval", "", pp "207--214", "London, UK".
Lee & S. Iliopoulos", "2005". "Two simple heuristics for the pattern matching on weighted sequences".
In "J. Ryan and P. Manyem and K. Sugeng and M. Miller", editor, "Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)", pp "409--414", "Ballarat, Australia".
Iliopoulos et al., "2005". "Algorithms for extracting structured motifs from biologically weighted sequences".
In "J. Ryan and P. Manyem and K. Sugeng and M. Miller", editor, "Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)", pp "125--136", "Ballarat, Australia".
Arikat et al., "2005". "Experimental results in pattern matching on weighted sequences".
In "Theodore Simos and George Maroulis", editor, "Proceedings of International Conference on Numerical Analysis and Applied Mathematics", Volume "", Issue "", "", pp "822--826", "". "".
Ardila et al., "2005". "Efficient ($\delta$,$\gamma$)-Pattern-Matching with Don`t Cares".
In "J. Ryan and P. Manyem and K. Sugeng and M. Miller", editor, "Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA)", pp "27--38", "Ballarat, Australia".
Iliopoulos et al., "2005". "Approximation Algorithm for the Cyclic Swap Problem".
In "J. Holub and M. Simanek", editor, "Proceedings of the Prague Stringology Conference (PSC`05)", pp "190--200".
Iliopoulos et al., "2005". "A First Approach to Finding Common Motifs with Gaps".
IJFCS, Volume "16", Issue "6", pp "1145--1155".
Crochemore et al., "2005". "Bit-parallel $(\gamma,\delta)$-matching and suffix automata".
"Journal of Discrete Algorithms", Volume "3", Issue "2-4", pp "198--214".
Cole et al., "2005". "The Complexity of the Minimum k-Cover Problem".
JALC, Volume "10", Issue "5".
Clifford et al., "2005". "Music Retrieval Algorithms for The Lead Sheet Problem".
"Journal of New Music Research", Volume "34", pp "311-317".
Clifford et al., "2005". "Faster algorithms for $\delta$, $\gamma$-matching and related problems".
In "Alberto Apostolico and Maxime Crochemore and Kunsoo Park", editor, "Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM`05)", Volume "3537", "Springer", pp "68--78".
Christodoulakis et al., "2005". "Approximate Seeds of Strings".
JALC, Volume "10", pp "609--626".
Cambouropoulos et al., "2005". "A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories".
In "T.~Crawford and M.~Sandler", editor, "Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR 2005)", pp "167--174".
Zhang et al., "2004". "String Matching with swaps in a Weighted Sequence".
In "Proceedings of International Symposium on Computational and Information Sciences (CIS 04)", Volume "3314", pp "698--704", "Shanghai, China".
Lee et al., "2004". "Linear time algorithm for the longest common repeat problem".
In "Alberto Apostolico and Massimo Melucci", editor, "Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE`04)", Volume "3246", Issue "", "Springer-Verlag Heidelberg", pp "10--17", "Padova, Italy".
Iliopoulos et al., "2004". "Motif Extraction from Weighted Sequences".
In "Alberto Apostolico and Massimo Melucci", editor, "Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE`04)", Volume "3246", Issue "", "Springer-Verlag Heidelberg", pp "286--297", "Padova, Italy".
Iliopoulos et al., "2004". "The Pattern Matching Problem in Biological Weighted Sequences".
In "P. Feraggina and R. Grossi", editor, "Proc. of Third International Conference on Fun with Algorithms (FUN 2004)", pp "106--117".
Iliopoulos et al., "2004". "New Complexity Results for the k-Covers Problem".
In "Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA`04)".
Iliopoulos et al., "2004". "Efficient Algorithms for Handling Molecular Weighted Sequences".
"IFIP Theoretical Computer Science", pp "273--287".
Iliopoulos et al., "2004". "Computing the regularities in biological weighted sequences".
In "Costas S. Iliopoulos and Thierry Lecroq", editor, "String Algorithmics", pp "109--128".
Iliopoulos et al., "2004". "A First Approach to Finding Common Motifs with Gaps".
In "Milan Simanek and Jan Jolub", editor, "Proceedings of the 2004 Prague Stringology Conference (PSC`04)", pp "88--97".
Iliopoulos & Rytter", "2004". "On Parallel Transformations of Suffix Arrays into Suffix Trees".
In "Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA`04)".
Crochemore et al., "2004". "Longest repeated motif with a block of don`t cares".
In "M. Farach-Colton", editor, "6th Latin American Theoretical INformatics (LATIN`04)", Volume "2976", "Springer-Verlag", pp "271--278".
Clifford et al., "2004". "Problems in Computational Musicology".
In "Costas S. Iliopoulos and Thierry Lecroq", editor, "String Algorithmics", "College Publications", pp "1--17".
Clifford et al., "2004". "Music retrieval algorithms for the lead sheet problem".
In "G. Assayag and V. Cafagna and M. Chemillier", editor, "Proceedings of the Sound and Music Computing International Conference 2004 (SMC`04)", "IRCAM", pp "141--146".
Clifford et al., "2004". "Extending the Edit Distance for Musical Applications".
In "Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA`04)", pp "97--102".
Clifford & S. Iliopoulos, "2004". "String algorithms in Music Analysis".
SC, Volume "8", Issue "9", pp "597--603".
Clifford & S. Iliopoulos, "2004". "Approximate String Matching for Music Analysis".
SC, Volume "8", "Springer-Verlag", pp "597--603".
Christodoulakis et al., "2004". "Searching for Regularities in Weighted Sequences".
In "Theodore Simos and George Maroulis", editor, "Lecture Series on Computer and Computational Sciences", pp "701--704".
Christodoulakis et al., "2004". "Pattern Matching on Weighted Sequences".
In "Katia S. Guimaraes and Marie-France Sagot", editor, "Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets`04)", "College publications", pp "17--30".
Christodoulakis et al., "2004". "Implementing Approximate Regularities".
MCM, Volume "42", Issue "7", pp "855--866".
"Costas S. Iliopoulos and T. Lecroq", editor, "2004". "String Algorithmics".
Volume "2", "College Publications".
Lee et al., "2003". "Finding Approximate Occurrences of a Pattern That Contains Gaps".
In "", editor, "Proceedings 14--th Australasian Workshop on Combinatorial Algorithms", Volume "", Issue "", "SNU Press", pp "89--100", "". "".
Iliopoulos et al., "2003". "String Regularities with Don`t Cares".
NJC, Volume "10", Issue "1", pp "40--51", . "".
Iliopoulos et al., "2003". "Computing the Repetitions in a Weighted Sequence".
In "M. Simanek", editor, "Proceedings of the 2003 Prague Stringology Conference (PSC`03)", Volume "10", Issue "5", "", pp "91--98", "". "".
Iliopoulos et al., "2003". "Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees".
In "", editor, "European Conference on Computational Biology", Volume "", Issue "", "", pp "539--540", "". "poster paper".
Crochemore et al., "2003". "A Bit-parallel Suffix Automaton Approach for $(\delta,\gamma)$-Matching in Music Retrieval".
In "Mario A. Nascimento and Edleno S. de Moura and Arlindo L. Oliveira", editor, "10th International Symposium on String Processing and Information Retrieval, SPIRE 2003", Volume "", Issue "", "Springer-Verlag", pp "211--223", "Manaus, Brazil". "".
Cole et al., "2003". "On Special Families of Morphisms Related to delta-Matching and Don`t Care Symbols".
IPL, Volume "85", Issue "5", pp "227--233", . "".
Cole et al., "2003". "Computing the Minimum k-Cover of a String".
In "M. Simanek", editor, "Proceedings of the 2003 Prague Stringology Conference (PSC`03)", Volume "", Issue "", "", pp "51--64", "". "".
Christodoulakis et al., "2003". "Implementing Approximate Regularities".
In "T. E. Simos", editor, "Proceedings of the International Conference on Computational Methods in Science and Engineering (ICCMSE2003)", Volume "", Issue "", "", pp "160--165", "Kastoria, Greece". "".
Christodoulakis et al., "2003". "Approximate Seeds of Strings".
In "M. Simanek", editor, "Proceedings of the 2003 Prague Stringology Conference (PSC`03)", Volume "10", Issue "5", "", pp "25--36", "". "".
Apostolico et al., "2003". "Truncated suffix trees".
TCS, Volume "304", Issue "", pp "87--101", . "".
Crochemore et al., "2003". "Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms".
FI, Volume "56", Issue "1,2", pp "89--103".
Crochemore et al., "2003". "Occurrence and substring heuristics for $\delta$-matching".
FI, Volume "56", Issue "1,2", pp "1-21".
"Diane Donovan and Costas S. Iliopoulos and Mirka Miller", editor, "2003". "Special Issue of the Journal of Automata, Languages and Combinatorics".
.
"Costas S. Iliopoulos and Tomasz Radzik", editor, "2003". "Combinatorial Algorithms".
"Elsevier".
Iliopoulos et al., "2002". "String Regularities with Don`t Cares".
In "M. Balik and M. Simanek", editor, "Proceedings of the 2002 Prague Stringology Conference 2002 (PSC`02)", Volume "", Issue "", "", pp "65--74", "". "".
Iliopoulos et al., "2002". "Identifying Occurrences of Maximal Pairs in Multiple Strings".
In "Alberto Apostolico and Masayuki Takeda", editor, "Proceedings of Combinatorial Pattern Matching (CPM`02)", Volume "", Issue "", "Springer-Verlag", pp "133--143", "". "".
Iliopoulos et al., "2002". "Evolution of Musical Motifs in Polyphonic Passages".
In "G. Wiggins", editor, "Symposium on AI and Creativity in Arts and Science, Proceedings of AISB`02", Volume "", Issue "", "The Society for the Study of Artificial Intelligence and Simulation of Behaviour", pp "67--76", "". "".
Iliopoulos & Mohamed", "2002". "Validation of Partially Occluded Images".
In "", editor, "Proceedings 29--th Software Seminar (Sofsem 2002)---Theory and Practice of Informatics", Volume "2540", Issue "", "", pp "218--230", "". "".
Iliopoulos & Kurokawa", "2002". "Exact and Approximate Distributed Matching for Musical Melodic Recognition".
In "G. Wiggins", editor, "Symposium on AI and Creativity in Arts and Science, Proceedings of AISB`02", Volume "", Issue "", "The Society for the Study of Artificial Intelligence and Simulation of Behaviour", pp "49--56", "". "".
Iliopoulos & Kurokawa", "2002". "Approximate matching with Gaps for Musical Melodic Recognition".
In "M. Balik and M. Simanek", editor, "Proceedings of the 2002 Prague Stringology Conference (PSC`02)", Volume "", Issue "", "", pp "55--64", "". "".
Daskalopulu et al., "2002". "On-line Analysis and Validation of Partially Occluded Images: Implementation and Practice".
IJCM, Volume "79", Issue "12", pp "1245--1259", . "".
Cambouropoulos et al., "2002". "Computing Approximate Repetitions in Musical Sequences".
IJCM, Volume "79", Issue "11", pp "1135--1148", . "".
Crochemore et al., "2002". "Three Heuristics for $\delta$-Matching: $\delta$-BM Algorithms".
In "A. Apostolico and M. Takeda", editor, "Symposium on Combinatorial Pattern Matching (CPM`2002)", Volume "2373", "Springer-Verlag", pp "178-189".
Crochemore et al., "2002". "Recovering an LCS in O$(n^2/w)$ time and space".
"Colombian Journal of Computation", Volume "3", Issue "1", pp "41--52".
Crochemore et al., "2002". "Approximate string matching with gaps".
"Nordic Journal of Computing", Volume "9", Issue "1", pp "54-65".
Cambouropoulos et al., "2002". "Algorithms for computing approximate repetitions in musical sequences".
"International Journal of Computer Mathematics", Volume "79", Issue "11", pp "1135--1148".
"Costas S. Iliopoulos and Mirka Miller and W. F. Smyth", editor, "2002". "Special Issue of the International Journal of Computer Mathematics".
Volume "79".
Sim et al., "2001". "Approximate periods of strings".
TCS, Volume "262", Issue "", pp "557--568", . "".
Iliopoulos et al., "2001". "The max-shift algorithm for approximate string matching".
In "G. S. Brodal and D Friogioni and A. Marchetti-Spaccamela", editor, "Proceedings of the 5th Workshop on Algorithm Engineering (WAE`01)", Volume "2141", "Springer-Verlag", pp "13--25", "Denmark".
Iliopoulos & Simpson", "2001". "On line validation and analysis of partially occluded images".
JALC, Volume "6", Issue "3", pp "291--303", . "".
Iliopoulos & F. Reid", "2001". "Decomposition of Partially Occluded Strings in the Presence of Errors".
IJPRAI, Volume "15", Issue "7", pp "1129--1142", . "".
Holub et al., "2001". "Distributed pattern matching using finite Automata".
JALC, Volume "6", Issue "2", pp "191--204", . "".
Crochemore et al., "2001". "Speeding-up Hirschberg and Hunt-Szymanski Algorithms for the LCS Problem".
In "", editor, "IEEE CS Proceedings, Symposium on String Processing and Information Retrieval (SPIRE01)", Volume "", Issue "", "IEEE Computer Society Press", pp "59--67", "Laguna de San Rafael, Chile". "".
Crochemore et al., "2001". "Approximate Repetitions in Musical Sequences".
In "M. Balik and M. Simanek", editor, "Proceedings of Prague Stringology Club Workshop (PSCW` 01)", Volume "", Issue "", "", pp "26--36", "Chech Technical University, Prague". "".
Crawford et al., "2001". "Approximate musical evolution".
CH, Volume "35", Issue "1", pp "55--64", . "".
Cole et al., "2001". "Relations between delta-matching and matching with don`t care symbols: delta-distinguishing morphisms".
In "E. Tri Baskoro", editor, "Proceedings 12--th Australasian Workshop on Combinatorial Algorithms", Volume "", Issue "", "", pp "80--87", "Bandung, Indonesia". "".
Cambouropoulos et al., "2001". "Pattern processing in melodic sequences: challenges, caveats and prospects".
CH, Volume "35", Issue "1", pp "9--21", . "".
Iliopoulos & J. Pinzon", "2001". "Recovering an LCS in $O(n^2/w)$ time and space".
In "Proceedings of the 12th Australian Workshop on Combinatorial Algorithms (AWOCA`01)", pp "116--117".
Crochemore et al., "2001". "Approximate string matching with gaps".
In "Proceedings of the World Multiconference on Systemics", Volume "10", "Cybernetics and Informatics", pp "45-50".
Crochemore et al., "2001". "A fast and practical bit-vector algorithms for the longest common subsequence problem".
IPL, Volume "80", Issue "6", pp "279--285".
Iliopoulos & F. Reid", "2000". "Decomposition of Partially Occluded Strings in the Presence of Errors".
In "", editor, "Proc. of the 7th International Workshop on Combinatorial Image Analysis (IWCIA`2000)", Volume "", Issue "", "", pp "227--239", "Caen, France". "".
Iliopoulos et al., "2000". "Motif Evolution in Polyphonic Musical Sequences".
In "L. Brankovic and J. Ryan", editor, "Proceedings 11--th Australasian Workshop on Combinatorial Algorithms", Volume "", Issue "", "", pp "53--66", "University of Newcastle, NSW, Australia". "".
Iliopoulos et al., "2000". "Computing Approximate Repetitions in Musical Sequences".
In "M. Balik and M. Simanek", editor, "Proceedings of Prague Stringology Club Workshop (PSCW` 00)", Volume "", Issue "", "", pp "49--59", "Chech Technical University, Prague". "".
Iliopoulos & F. Reid", "2000". "Optimal parallel analysis and decomposition of partially occluded strings".
PC, Volume "26", Issue "4", pp "483--494", . "".
Crochemore et al., "2000". "Fast evolutionary chains".
In "V Hlavac, K.G. Jefery and J. Wiedermann ", editor, "Proceedings of 27--th Software Seminar (SOFTSEM`00)", Volume "1963", Issue "", "", pp "371--380", "". "".
Crochemore et al., "2000". "Finding Motifs with Gaps".
In "Proceedings of International Symposium on Music Information Retrieval (ISMIR`00)", pp "306--317", "Plymouth, Massachusetts".
Crochemore et al., "2000". "A fast and practical bit-vector algorithms for the longest common subsequence problem".
In "L. Brankovic and J. Ryan", editor, "Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithms, AWOCA`2000", "University of Newcastle, NSW, Australia", pp "75--86".
Crochemore et al., "2000". "A failure function for multiple two-dimensional pattern matching".
"Combinatorial Mathematics and Combinatorial Computing", Volume "35", pp "225-238".
"Costas S. Iliopoulos", editor, "2000". "Special Issue of Theoretical Computer Science on Combinatorial Algorithms".
Volume "249", Issue "2".
Sim et al., "1999". "Approximate periods of strings".
In "M. Crochemore and M. Paterson", editor, "Proceedings of 10--th Symposium on Combinatorial Pattern Matching", Volume "1645", Issue "", "Springer Verlag", pp "", "". "".
Iliopoulos & Mouchard", "1999". "Quasiperiodicity: from detection to normal forms".
JALC, Volume "4", Issue "3", pp "213--228", . "".
Iliopoulos & Mouchard", "1999". "Quasiperiodicity and string covering".
TCS, Volume "218", Issue "1", pp "205--216", . "".
Iliopoulos & Mouchard", "1999". "An $O(n\log n)$ algorithm for computing all maximal quasiperiodicities in strings".
In "", editor, "Proceedings of Computing: Australasian Theory Symposium (CATS`99)", Volume "21", Issue "3", "Springer Verlag", pp "262--272", "Auckland, New Zealand". "".
Holub et al., "1999". "Distributed Pattern Matching".
In "J. Simpson and R. Raman", editor, "Proceedings 10--th Australasian Workshop on Combinatorial Algorithms", Volume "3", Issue "", "Curtin University Press", pp "129--145", "". "".
Crawford et al., "1999". "Approximate musical evolution".
In "G. Wiggins", editor, "Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB`99)", Volume "6", Issue "", "", pp "76--81", "Edinburgh". "".
Cambouropoulos et al., "1999". "Pattern processing in melodic sequences: challenges, caveats and prospects".
In "G. Wiggins", editor, "Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB`99)", Volume "", Issue "", "", pp "42--47", "Edinburgh". "".
Cambouropoulos et al., "1999". "Algorithms for computing approximate repetitions in musical sequences".
In "J. Simpson and R. Raman", editor, "Proceedings 10--th Australasian Workshop on Combinatorial Algorithms", Volume "3", Issue "", "Curtin University Press", pp "114--128", "". "".
Holub et al., "1999". "Distributed String Matching using Finite Automata".
In "R. Raman and J. Simpson", editor, "Proceedings of the Tenth Australian Workshop on Combinatorial Algorithms, AWOCA`99 (Perth, 1999)", "School of Computing, Curtin University of Technology, Perth, Western Australia", pp "114--128".
Iliopoulos et al., "1998". "The covers of a circular Fibonacci string".
JCMCC, Volume "26", Issue "", pp "227--236", . "".
Iliopoulos & Mouchard", "1998". "Fast Local Covers".
Issue "TR-98-03", "Department of Computer Science, King`s College London".
Iliopoulos & Korda", "1998". "Massively parallel construction of suffix arrays".
In "Ed. Rovan", editor, "Proceedings of 25--th Software Seminar (SOFTSEM`98)", Volume "1521", Issue "", "", pp "371--380", "". "".
Iliopoulos & F. Smyth", "1998". "On line algorithms for $k$-covering".
In "C. S. Iliopoulos", editor, "Proceedings of the 9--th Australasian Workshop on Combinatorial Algorithms", Volume "6", Issue "", "", pp "97--106", "Perth, WA, Australia". "".
Iliopoulos & F. Reid", "1998". "Validating and decomposing partially occluded two-dimensional images".
In "J. Holub and M. Simanek", editor, "Proceedings of the 1998 Prague Stringology Club Workshop (PSCW` 98)", Volume "6", Issue "", "", pp "83--94", "Prague". "".
Crawford et al., "1998". "String matching techniques for musical similarity and melodic recognition".
CM, Volume "11", Issue "", pp "73--100", . "".
Crochemore et al., "1998". "Two-dimensional prefix string matching and covering on square matrices".
"Algorithmica", Volume "20", pp "353--373".
Crochemore et al., "1998". "Two-dimensional dictionary prefix-matching".
In "Iliopoulos, Costas S.", editor, "Proceedings of the ninth Australian Workshop on Combinatorial Algorithms, AWOCA`98 (Perth, 1998)", "School of Computing, Curtin University of Technology, Perth, Western Australia", pp "147--158".
Crochemore et al., "1998". "Algorithms for computing evolutionary chains in molecular and musical sequences".
In "Costas S. Iliopoulos", editor, "Proceedings of the ninth Australian Workshop on Combinatorial Algorithms AWOCA`98 (Perth, 1998)", "School of Computing, Curtin University of Technology, Perth, Western Australia", pp "172--184".
"Costas S. Iliopoulos", editor, "1998". "Proceedings of the 9--th Australasian Workshop on Combinatorial Algorithms".
Volume "6", "Curtin Press", . "186 pages".
"Costas S. Iliopoulos", editor, "1998". .
In "Proceedings of the 9th Australian Workshop on Combinatorial Algorithms (AWOCA`98)", "School of Computing, Curtin University of Technology, Perth, Western Australia".
Iliopoulos et al., "1997". "On the exact occurrences of squares in Fibonacci strings".
TCS, Volume "172", Issue "", pp "281--291", . "".
Iliopoulos & Simpson", "1997". "On-line validation and analysis of Occluded Images".
In "", editor, "Proceedings of the 8--th Australasian Workshop on Combinatorial Algorithms (AWOCA`97)", Volume "", Issue "", "", pp "25--36", "". "".
Iliopoulos & F. Reid", "1997". "An optimal parallel algorithm for analysing occluded images".
In "N. Sharda and A. Tam", editor, "Proceedings of the 4--th Australasian Conference on Parallel and Real--Time systems (PART`97)", Volume "", Issue "", "Springer Verlag", pp "104--113", "". "".
Iliopoulos et al., "1996". "Covering a string".
Alg, Volume "16", Issue "", pp "288--297", . "".
Iliopoulos et al., "1996". "A linear algorithm for computing the squares of a Fibonacci string".
In "P. Eades and M. Moule", editor, "Proceedings of Computing: Australasian Theory Symposium (CATS`96)", Volume "", Issue "", "", pp "55--63", "". "".
Iliopoulos & Park", "1996". "An $O(\log \log n)$ PRAM Algorithm for computing all seeds of a string".
TCS, Volume "164", Issue "", pp "299--310", . "".
Iliopoulos & N. Galley", "1996". "On the lower bound for parallel string matching".
IJCM, Volume "62", Issue "3--4", pp "", . "".
Iliopoulos & N. Galley", "1996". "A PRAM algorithm for a special case of the set partition problem".
JPAA, Volume "10", Issue "", pp "105--109", . "".
Iliopoulos & Korda", "1996". "Parallel two dimensional covering".
In "", editor, "Proceedings of the 7--th Australasian Workshop on Combinatorial Algorithms (AWOCA`96)", Volume "", Issue "", "", pp "62--75", "". "".
Iliopoulos & Korda", "1996". "Optimal parallel superprimitivity testing on square arrays".
PPL, Volume "6", Issue "3", pp "299--308", . "".
SIliopoulos", "1995". "An optimal algorithm for prefix string matching and covering".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "58", Issue "", "", pp "227", "". "(Abstract)".
Iliopoulos & F. Smyth", "1995". "A fast average case algorithm for Lyndon decomposition".
IJCM, Volume "57", Issue "", pp "15--31", . "".
Berkman et al., "1995". "The subtree max gap problem with application to parallel string covering".
IC, Volume "123", Issue "1", pp "127--137", . "".
Iliopoulos & Park", "1994". "An optimal $O(\log \log n)$ time algorithm for parallel superprimitivity testing".
JKISS, Volume "21", Issue "8", pp "1400--1404", . "".
Iliopoulos & N. Galley", "1994". "An $O(n\log n)$ cost single function partitioning problem".
PPL, Volume "4", Issue "4", pp "437--445", . "".
Farrell et al., "1994". "Performance implications of virtualization".
In "", editor, "Proceedings of Western Australian Computer Science Symposium `94", Volume "", Issue "", "UWA Press", pp "", "Perth W.A". "".
Farrell et al., "1994". "Performance implications of virtualization of massively parallel algorithm implementation".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "24", Issue "", "", pp "249", "". "".
Daykin et al., "1994". "Parallel algorithms for factorizing strings over an ordered alphabet".
TCS, Volume "127", Issue "", pp "53--67", . "".
Berkman et al., "1994". "The subtree max gap problem with application to parallel string covering".
In "", editor, "Proceedings 5--th ACM--SIAM Symposium on Discrete Algorithms", Volume "", Issue "", "", pp "501--510", "". "".
SIliopoulos", "1993". "Parallel algorithms for string pattern matching".
In "A. Gibbons and P. Spyrakis", editor, "Lectures on Parallel Computation", Volume "4", Issue "", "Cambridge Univ. Press", pp "109--121", "". "".
Iliopoulos et al., "1993". "Covering a string".
In "", editor, "Proceedings of the 4--th Symposium on Combinatorial Pattern Matching", Volume "684", Issue "", "Springer-Verlag", pp "54--62", "Berlin". "".
Iliopoulos & Galley", "1993". "An $O(n\log n)$ cost single function partitioning problem".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "50", Issue "", "", pp "358", "". "(Abstract)".
Iliopoulos & F. Smyth", "1992". "An optimal parallel algorithm for computing the canonical form of a circular string".
TCS, Volume "92", Issue "", pp "87--105", . "".
Iliopoulos & W. G. Moore", "1991". "Algorithms for the general seed problem".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "45", Issue "", "", pp "310--311", "". "(Abstract)".
Daykin et al., "1991". "Parallel algorithms for factorizing strings over an ordered alphabet".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "45", Issue "", "", pp "309--310", "". "(Abstract)".
Apostolico et al., "1991". "Optimal superprimitivity testing for strings".
IPL, Volume "39", Issue "", pp "17--20", . "".
Iliopoulos & F. Smyth", "1990". "An optimal parallel algorithm for computing the canonical form of a circular string".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "", Issue "", "", pp "258", "". "(Abstract)".
Iliopoulos & F. Smyth", "1989". "An optimal PRAM algorithm for identifying polygon similarity".
In "", editor, "Proc. of International Symposium on Optimal Algorithms", Volume "", Issue "", "", pp "50--51", "Sofia". "".
Iliopoulos & F. Smyth", "1989". "A comparison of three optimal algorithms for the canonization of circular strings".
JCISS, Volume "14", Issue "2--3", pp "59--72", . "".
SIliopoulos", "1988". "Worst-case complexity bounds on algorithms for computing the structure of finite abelian groups and Hermite and Smith normal forms of an integer matrix".
SIAMJC, Volume "18", Issue "", pp "131--141", . "".
SIliopoulos", "1988". "On the computational complexity of the abelian permutation group structure, membership and intersection problems".
TCS, Volume "56", Issue "", pp "211--222", . "".
Apostolico & S. Iliopoulos", "1988". "A parallel $\log$--time construction of suffix trees".
"Computer Science Technical Reports. Paper 549.", Volume "", Issue "", pp "", . "".
Apostolico et al., "1988". "Parallel construction of a suffix tree with applications".
"Algorithmica", Volume "3", Issue "2" springerlink:10.1007/BF01762122, "Springer New York", pp "347-365", . 10.1007/BF01762122.
Apostolico et al., "1987". "An $O(n \log n)$ cost parallel algorithm for the single function coarsest partition problem".
In "", editor, "Mathematische Forschung", Volume "", Issue "", "", pp "70--76", "Band 38, Akademie Verlag, Berlin". "".
Apostolico & S. Iliopoulos", "1987". "A parallel log time construction of suffix trees".
In "", editor, "European Assoc. for Theor. Comp. Sc. Bulletin", Volume "32", Issue "", "", pp "220--228", "". "(Abstract)".
Apostolico et al., "1987". "On $O(n log n)$ Cost Parallel Algorithm for the Single Function Coarsest Partition Problem".
In "A. Albrecht and H. Jung and K. Mehlhorn", editor, "Parallel Algorithms and Architectures", Volume "269", "Springer", pp "70-76".
SIliopoulos", "1986". "Worst-case analysis of algorithms for computational problems on abelian permutation groups".
In "", editor, "SIGSAM Bulletin 20", Volume "1 & 2", Issue "", "", pp "52", "". "(Abstract)".
SIliopoulos", "1986". "Monte Carlo circuits for the abelian permutation group intersection problem".
AI, Volume "23", Issue "3", pp "697--705", . "".
SIliopoulos", "1985". "Worst-case analysis of algorithms for computational problems on abelian permutation groups".
In "", editor, "Lecture notes in Computer Science", Volume "204", Issue "", "Springer Verlag", pp "214--222", "". "".
SIliopoulos", "1985". "Gaussian elimination over an Euclidean ring".
In "", editor, LNCS, Volume "204", Issue "", "Springer Verlag", pp "102--107", "". "".
SIliopoulos", "1985". "Computing on general abelian groups is hard".
TCS, Volume "41", Issue "1", pp "81--93", . "".
SIliopoulos", "1985". "Analysis of Algorithms on problems on general abelian groups".
IPL, Volume "20", Issue "4", pp "215--220", . "".
Beynon & S. Iliopoulos", "1985". "Computing a basis for a finite abelian p-group".
IPL, Volume "20", Issue "3", pp "161--163", . "".
SIliopoulos", "1984". "Improved worst-case complexity bounds on computations on abelian groups represented by a set of generators".
In "", editor, "Proc. of International Congress of App. Math.", Volume "", Issue "", "", pp "83--87", "Lieuven, Belgium". "".
SIliopoulos", "1982". "Analysis of an Algorithm for Composition of Binary Quadratic Forms".
JA, Volume "3", Issue "", pp "257--259", . "".