[108]  H. Alamro, L. A. K. Ayad, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "Longest Common Prefixes with kMismatches & Applications", in SOFSEM 2018: Theory and Practice of Computer Science  44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer International Publishing.

[107]  T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Efficient Algorithms for Shortest Partial Seeds in Words", Theoretical Computer Science, 2017.

[106]  R. Grossi, C. S. Iliopoulos, C. Liu, N. Pisanti, S. P. Pissis, A. Retha, G. Rosone, F. Vayani, L. Versari, "OnLine Pattern Matching on Similar Texts", in 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), J. R. Juha Kärkkäinen, W. Rytter, Eds., Dagstuhl, Germany: Schloss Dagstuhl–LeibnizZentrum fuer Informatik, pp. 9:1–9:14.

[105]  A. Heliou, S. P. Pissis, S. J. Puglisi, "emMAW: computing minimal absent words in external memory", Bioinformatics, vol. 33, no. 17, 2017, pp. 27462749.

[104]  M. Crochemore, A. P. Francisco, S. P. Pissis, C. Vaz, "Towards DistanceBased Phylogenetic Inference in AverageCase LinearTime", in 17th International Workshop on Algorithms in Bioinformatics (WABI 2017), R. Schwartz, K. Reinert, Eds., Dagstuhl, Germany: Schloss Dagstuhl–LeibnizZentrum fuer Informatik, pp. 9:1–9:14.

[103]  Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos, "Optimal Computation of Overabundant Words", in 17th International Workshop on Algorithms in Bioinformatics (WABI 2017), R. Schwartz, K. Reinert, Eds., Dagstuhl, Germany: Schloss Dagstuhl–LeibnizZentrum fuer Informatik, pp. 4:1–4:14.

[102]  L. A. K. Ayad, C. Barton, S. P. Pissis, "A faster and more accurate heuristic for cyclic edit distance computation", Pattern Recognition Letters, vol. 88, 2017, pp. 81–87.

[101]  C. S. Iliopoulos, S. P. Pissis, M. S. Rahman, Searching and Indexing Circular Patterns, Cham: Springer International Publishing, 2017, pp. 77–90.

[100]  M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "How to answer a small batch of RMQs or LCA queries in practice", in Combinatorial Algorithms, Springer International Publishing, 2017.

[99]  T. Athar, C. Barton, W. Bland, J. Gao, C. S. Iliopoulos, C. Liu, S. P. Pissis, "Fast circular dictionarymatching algorithm", Mathematical Structures in Computer Science, vol. 27, no. 2, 2017, pp. 143–156.

[98]  C. S. Iliopoulos et al., Eds., 16th International Symposium on Experimental Algorithms, SEA 2017, June 2123, 2017, London, UK, Schloss Dagstuhl  LeibnizZentrum fuer Informatik.

[97]  M. Crochemore, A. Heliou, G. Kucherov, L. Mouchard, S. P. Pissis, Y. Ramusat, "Minimal Absent Words in a Sliding Window and Applications to OnLine Pattern Matching", in Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings, R. Klasing, M. Zeitoun, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2017, pp. 164–176.

[96]  P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Efficient Enumeration of NonEquivalent Squares in Partial Words with Few Holes", in Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 35, 2017, Proceedings, Y. Cao, J. Chen, Eds., Cham: Springer International Publishing, 2017, pp. 99–111.

[95]  M. Alzamel, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, W. Sung, "Faster algorithms for 1mappability of a sequence", in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16–18, 2017, Proceedings, Cham: Springer International Publishing.

[94]  G. Bernardini, N. Pisanti, S. P. Pissis, G. Rosone, "Pattern Matching on ElasticDegenerate Text with Errors", in String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings, G. Fici, M. Sciortino, R. Venturini, Eds., Cham: Springer International Publishing, pp. 74–90.

[93]  L. A. K. Ayad, S. P. Pissis, "MARS: improving multiple circular sequence alignment using refined sequences", BMC Genomics, vol. 18, no. 1, 2017, pp. 86.

[92]  A. Amir, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, J. Radoszewski, "Longest Common Factor After One Edit Operation", in String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings, G. Fici, M. Sciortino, R. Venturini, Eds., Cham: Springer International Publishing, pp. 14–26.

[91]  M. Alzamel, J. Gao, C. S. Iliopoulos, C. Liu, S. P. Pissis, "Efficient Computation of Palindromes in Sequences with Uncertainties", in Engineering Applications of Neural Networks: 18th International Conference, EANN 2017, Athens, Greece, August 25–27, 2017, Proceedings, G. Boracchi et al., Eds., Cham: Springer International Publishing, 2017, pp. 620–629.

[90]  C. Barton, S. P. Pissis, "Crochemore's Partitioning on Weighted Strings and Applications", Algorithmica, 2017.

[89]  H. Alamro, M. Alzamel, C. S. Iliopoulos, S. P. Pissis, S. Watts, W. Sung, "Efficient Identification of kClosed Strings", in Engineering Applications of Neural Networks: 18th International Conference, EANN 2017, Athens, Greece, August 25–27, 2017, Proceedings, G. Boracchi et al., Eds., Cham: Springer International Publishing, 2017, pp. 583–595.

[88]  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", Algorithms for Molecular Biology, vol. 12, no. 1, 2017, pp. 5.

[87]  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.

[86]  T. Kociumaka, S. P. Pissis, J. Radoszewski, "Pattern Matching and Consensus Problems on Weighted Sequences and Profiles", in 27th International Symposium on Algorithms and Computation (ISAAC 2016), S. Hong, Ed., Dagstuhl, Germany: Schloss Dagstuhl–LeibnizZentrum fuer Informatik, pp. 46:1–46:12.

[85]  C. Barton, T. Kociumaka, S. P. Pissis, J. Radoszewski, "Efficient Index for Weighted Sequences", in 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), R. Grossi, M. Lewenstein, Eds., Dagstuhl, Germany: Schloss Dagstuhl–LeibnizZentrum fuer Informatik, pp. 4:1–4:13.

[84]  M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "OrderPreserving Indexing", Theoretical Computer Science, vol. 638, 2016, pp. 122–135.

[83]  M. Crochemore, C. S. Iliopoulos, T. Kociumaka, R. Kundu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "NearOptimal Computation of Runs over General Alphabet via NonCrossing LCE Queries", in String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 1820, 2016, Proceedings, S. Inenaga, K. Sadakane, T. Sakai, Eds., Cham: Springer International Publishing, 2016, pp. 22–34.

[82]  C. Barton, C. S. Iliopoulos, S. P. Pissis, S. Arhondakis, "Transcriptome activity of isochores during preimplantation process in human and mouse", FEBS Letters, vol. 590, no. 14, 2016, pp. 2297–2306.

[81]  L. A. K. Ayad, S. P. Pissis, A. Retha, "libFLASM: a software library for fixedlength approximate string matching", BMC Bioinformatics, vol. 17, 2016, pp. 454:1–454:12.

[80]  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, 2016, pp. 12.

[79]  M. Crochemore, G. Fici, R. Mercas, S. P. Pissis, "LinearTime Sequence Comparison Using Minimal Absent Words & Applications", in LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 1115, 2016, Proceedings, E. Kranakis, G. Navarro, E. Chávez, Eds., Springer Berlin Heidelberg, 2016, pp. 334–346.

[78]  C. Barton, C. Liu, S. P. Pissis, "OnLine Pattern Matching on Uncertain Sequences and Applications", in Combinatorial Optimization and Applications: 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings, T. H. Chan, M. Li, L. Wang, Eds., Cham: Springer International Publishing, 2016, pp. 547–562.

[77]  L. Brankovic, C. S. Iliopoulos, R. Kundu, M. Mohamed, S. P. Pissis, F. Vayani, "Lineartime superbubble identification algorithm for genome assembly", Theoretical Computer Science, vol. 609, Part 2, 2016, pp. 374–383.

[76]  C. Barton, C. Liu, S. P. Pissis, "Lineartime computation of prefix table for weighted strings & applications", Theoretical Computer Science, vol. 656, Part B, 2016, pp. 160–172.

[75]  Y. Almirantis, P. Charalampopoulos, J. Gao, C. S. Iliopoulos, M. Mohamed, S. P. Pissis, D. Polychronopoulos, "Optimal Computation of Avoided Words", in Algorithms in Bioinformatics: 16th International Workshop, WABI 2016, Aarhus, Denmark, August 2224, 2016. Proceedings, M. Frith, N. C. Storm Pedersen, Eds., Springer International Publishing, 2016, pp. 1–13.

[74]  S. P. Pissis, A. Retha, "Generalised Implementation for FixedLength Approximate String Matching under Hamming Distance and Applications", in 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, IPDPS 2015, Hyderabad, India, May 2529, 2015, IEEE, pp. 367–374.

[73]  T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Fast Algorithm for Partial Covers in Words", Algorithmica, vol. 73, no. 1, 2015, pp. 217–233.

[72]  C. Barton, S. P. Pissis, "LinearTime Computation of Prefix Table for Weighted Strings", in Combinatorics on Words, F. Manea, D. Nowotka, Eds., Springer International Publishing, 2015, pp. 73–84.

[71]  R. Grossi, C. S. Iliopoulos, R. Mercas, N. Pisanti, S. P. Pissis, A. Retha, F. Vayani, "Circular Sequence Comparison with qgrams", in Algorithms in Bioinformatics, M. Pop, H. Touzet, Eds., Springer Berlin Heidelberg, 2015, pp. 203–216.

[70]  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.

[69]  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, E. Bampis, Ed., Springer International Publishing Switzerland, 2015, pp. 247–258.

[68]  C. Barton, A. Heliou, L. Mouchard, S. P. Pissis, "Parallelising the Computation of Minimal Absent Words", in Parallel Processing and Applied Mathematics  11th International Conference, PPAM 2015, Krakow, Poland, September 69, 2015. Revised Selected Papers, Part II, R. Wyrzykowski et al., Eds., Springer, 2015, pp. 243–253.

[67]  M. Aljamea, T. Athar, C. S. Iliopoulos, S. P. Pissis, M. S. Rahman, "A Novel Pattern Matching Approach for Fingerprintbased Authentication", in PATTERNS 2015: The Seventh International Conferences on Pervasive Patterns and Applications, IARIA, pp. 45–49.

[66]  C. Barton, C. S. Iliopoulos, S. P. Pissis, "AverageCase Optimal Approximate Circular String Matching", in Language and Automata Theory and Applications, A. Dediu et al., Eds., Springer Berlin Heidelberg, 2015, pp. 85–96.

[65]  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, K. Jan, M. Miller, D. Froncek, Eds., Springer International Publishing, 2015, pp. 49–61.

[64]  H. Bannai, S. P. Pissis, "Editorial", Journal of Discrete Algorithms, vol. 34, 2015, pp. 1.

[63]  V. Ghanaei, C. S. Iliopoulos, S. P. Pissis, "Detection of Web Spambot in the Presence of Decoy Actions", in Big Data and Cloud Computing (BdCloud), 2014 IEEE Fourth International Conference on, pp. 277–279.

[62]  T. Flouri, K. Kobert, S. P. Pissis, A. Stamatakis, "An optimal algorithm for computing all subtree repeats in trees", Philosophical Transactions A, vol. 372, no. 2016, 2014.

[61]  S. P. Pissis, C. Goll, P. Pavlidis, A. Stamatakis, "Accelerating String Matching on MIC Architecture for Motif Extraction", in Parallel Processing and Applied Mathematics, R. Wyrzykowski et al., Eds., Springer Berlin Heidelberg, 2014, pp. 258–267.

[60]  S. P. Pissis, "MoTeXII: structured MoTif eXtraction from largescale datasets", BMC Bioinformatics, vol. 15, 2014, pp. 235.

[59]  C. Barton, A. Heliou, L. Mouchard, S. P. Pissis, "Lineartime Computation of Minimal Absent Words Using Suffix Array", BMC Bioinformatics, vol. 15, 2014, pp. 388.

[58]  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. 915.

[57]  T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Efficient Algorithms for Shortest Partial Seeds in Words", in Combinatorial Pattern Matching, A. S. Kulikov, S. O. Kuznetsov, P. Pevzner, Eds., Springer International Publishing, 2014, pp. 192201.

[56]  C. Barton, C. S. Iliopoulos, I. Lee, L. Mouchard, K. Park, S. P. Pissis, "Extending alignments with $k$mismatches and $\ell$gaps", Theoretical Computer Science, vol. 525, 2014, pp. 8088.

[55]  C. Barton, C. S. Iliopoulos, S. P. Pissis, "Optimal Computation of all Tandem Repeats in a Weighted Sequence", Algorithms for Molecular Biology, vol. 9, no. 21, 2014.

[54]  C. Barton, C. S. Iliopoulos, S. P. Pissis, "Fast Algorithms for Approximate Circular String Matching", Algorithms for Molecular Biology, vol. 9, no. 9, 2014.

[53]  C. S. Iliopoulos, S. P. Pissis, "Algorithms for nextgeneration sequencing data", in Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data, M. Elloumi, A. Y. Zomaya, Eds., Wiley, 2013, pp. 251–279.

[52]  Amborella~Genome~Project, "The Amborella Genome and the Evolution of Flowering Plants", Science, vol. 342, no. 6165, 2013.

[51]  T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Fast Algorithm for Partial Covers in Words", in Combinatorial Pattern Matching, J. Fischer, P. Sanders, Eds., Springer Berlin Heidelberg, 2013, pp. 177188.

[50]  M. Crochemore, C. S. Iliopoulos, T. Kociumaka, M. Kubica, A. Langiu, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "OrderPreserving Incomplete Suffix Trees and OrderPreserving Indexes", in String Processing and Information Retrieval, O. Kurland, M. Lewenstein, E. Porat, Eds., Springer International Publishing, 2013, pp. 8495.

[49]  N. Alachiotis, S. Berger, T. Flouri, S. P. Pissis, A. Stamatakis, "libgapmis: extending shortread alignments", BMC Bioinformatics, vol. 14, no. (Suppl 11), 2013, pp. S4.

[48]  S. P. Pissis, A. Stamatakis, P. Pavlidis, "MoTeX: A wordbased HPC tool for MoTif eXtraction", in Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, New York, NY, USA: ACM, 2013, pp. 13–22.

[47]  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.

[46]  F. IzquierdoCarrasco, N. Alachiotis, S. Berger, T. Flouri, S. P. Pissis, A. Stamatakis, "A Generic Vectorization Scheme and a GPU Kernel for the Phylogenetic Likelihood Library", in Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, Washington, DC, USA: IEEE Computer Society, pp. 530–538.

[45]  T. Flouri, K. Kobert, S. P. Pissis, A. Stamatakis, "An Optimal Algorithm for Computing All Subtree Repeats in Trees", in Combinatorial Algorithms, T. Lecroq, L. Mouchard, Eds., Springer Berlin Heidelberg, 2013, pp. 269282.

[44]  C. Barton, C. S. Iliopoulos, S. P. Pissis, "Circular string matching revisited", in Proceedings of the Fourteenth Italian Conference on Theoretical Computer Science (ICTCS 2013), pp. 200205.

[43]  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 & Gene Sequences, vol. 7, no. 2, 2013, pp. 84  95.

[42]  K. Frousios, C. S. Iliopoulos, G. Tischler, S. Kossida, S. P. Pissis, S. Arhondakis, "Transcriptome map of mouse isochores in embryonic and neonatal cortex", Genomics, vol. 101, no. 2, 2013, pp. 120  124.

[41]  T. Flouri, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, S. J. Puglisi, W. Smyth, W. Tyczynski, "Enhanced string covering", Theoretical Computer Science, vol. 506, 2013, pp. 102  114.

[40]  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.

[39]  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, vol. 483, 2013, pp. 171  181.

[38]  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–411.

[37]  C. Barton, M. Giraud, C. S. Iliopoulos, T. Lecroq, L. Mouchard, S. P. Pissis, "Querying highly similar sequences", International Journal of Computational Biology and Drug Design, vol. 6, no. 1, 2013, pp. 119  130.

[36]  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. 304311.

[35]  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, New York, NY, USA: ACM, 2012, pp. 820–825.

[34]  C. Hadjinikolis, C. S. Iliopoulos, S. P. Pissis, A. Stamatakis, "Minimising processor communication in parallel approximate string matching", Heidelberg Institute for Theoretical Studies, Rep. ExelixisRRDR20128.

[33]  T. Flouri, C. S. Iliopoulos, K. Park, S. P. Pissis, "GapMisOMP: Pairwise ShortRead Alignment on Multicore Architectures", in Artificial Intelligence Applications and Innovations, L. Iliadis et al., Eds., Springer Berlin Heidelberg, 2012, pp. 593601.

[32]  C. S. Iliopoulos, M. Miller, 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. 02, 2012, pp. 249259.

[31]  T. Flouri, K. Kobert, S. P. Pissis, A. Stamatakis, "A simple method for computing all subtree repeats in unordered trees in linear time", in Festschrift for Borivoj Melichar, J. Holub, B. W. Watson, J. Zdarek, Eds., Czech Technical University in Prague, 2012, pp. 145152.

[30]  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), J. Holub, J. Zdarek, Eds., Czech Technical University in Prague, pp. 75–88.

[29]  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, 2012, pp. 15  22.

[28]  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.

[27]  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.

[26]  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.

[25]  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.

[24]  N. Alachiotis, S. Berger, T. Flouri, S. P. Pissis, A. Stamatakis, "Libgapmis: An ultrafast library for shortread singlegap alignment", 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2012, pp. 688695.

[23]  S. P. Pissis, "Algorithms on strings with applications in molecular biology", Ph.D. dissertation, King's College London, London, 2011.

[22]  M. Christou, M. Crochemore, T. Flouri, C. Iliopoulos, J. Janousek, B. Melichar, S. 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. 338343.

[21]  T. Flouri, J. Janousek, B. Melichar, C. Iliopoulos, S. Pissis, "Tree Template Matching in Ranked Ordered Trees by Pushdown Automata", in Implementation and Application of Automata, B. BouchouMarkhoff et al., Eds., Springer Berlin / Heidelberg, 2011, pp. 273281.

[20]  M. Christou, M. Crochemore, C. Iliopoulos, M. Kubica, S. Pissis, J. Radoszewski, W. Rytter, B. Szreder, T. Waleń, "Efficient Seeds Computation Revisited", in Combinatorial Pattern Matching, R. Giancarlo, G. Manzini, Eds., Springer Berlin / Heidelberg, 2011, pp. 350363.

[19]  M. Christou, M. Crochemore, O. Guth, C. S. Iliopoulos, S. P. Pissis, "On the RightSeed Array of a String", in Computing and Combinatorics, B. Fu, D. Du, Eds., Springer Berlin Heidelberg, 2011, pp. 492502.

[18]  O. Phanalasy, M. Miller, C. 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. 8187.

[17]  T. Flouri, C. S. Iliopoulos, S. P. Pissis, "DynMap: mapping short reads to multiple related genomes", in Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, New York, NY, USA: ACM, 2011, pp. 330–334.

[16]  T. Flouri, K. Park, K. Frousios, S. P. Pissis, C. S. Iliopoulos, G. Tischler, "Approximate stringmatching with a single gap for sequence alignment", in Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine, New York, NY, USA: ACM, 2011, pp. 490–492.

[15]  "Tree Indexing by Pushdown Automata and Repeats of Subtrees", in Federated Conference on Computer Science and Information Systems  FedCSIS 2011, Szczecin, Poland, 1821 September 2011, Proceedings, M. Ganzha, L. A. Maciaszek, M. Paprzycki, Eds., IEEE, pp. 899–902.

[14]  S. Arhondakis, K. Frousios, C. S. Iliopoulos, S. Pissis, G. Tischler, S. Kossida, "Transcriptome map of mouse isochores", BMC Genomics, vol. 12, no. 1, 2011, pp. 511.

[13]  M. Crochemore, C. Iliopoulos, S. Pissis, G. Tischler, "Cover Array String Reconstruction", in Combinatorial Pattern Matching, A. Amir, L. Parida, Eds., Springer Berlin / Heidelberg, 2010, pp. 251259.

[12]  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. 399403.

[11]  M. Crochemore, C. S. Iliopoulos, S. P. Pissis, "A Parallel Algorithm for FixedLength Approximate StringMatching with kmismatches", in Algorithms and Applications, T. Elomaa, H. Mannila, P. Orponen, Eds., Springer Berlin Heidelberg, 2010, pp. 92101.

[10]  C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "A Parallel Algorithm for the Fixedlength Approximate String Matching Problem for High Throughput Sequencing Technologies", in Proceedings of the International Conference on Parallel Computing (PARCO 2009), IOS Press, 2010, pp. 150157.

[9]  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, New York, NY, USA: ACM, 2010, pp. 154159.

[8]  P. Antoniou, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "Algorithms for mapping short degenerate and weighted sequences to a reference genome", International Journal of Computational Biology and Drug Design, vol. 2, no. 4, 2010, pp. 385  397.

[7]  K. K. Chang, S. P. Pissis, J. R. Jang, C. Iliopoulos, "Subnyquist audio fingerprinting for music recognition", in Computer Science and Electronic Engineering Conference (CEEC), 2010 2nd, pp. 15.

[6]  T. Flouri, J. Holub, C. S. Iliopoulos, S. P. Pissis, "An algorithm for mapping short reads to a dynamically changing genomic sequence", in Bioinformatics and Biomedicine (BIBM), 2010 IEEE International Conference on, pp. 133136.

[5]  C. S. Iliopoulos, T. A. Okanlawon, S. P. Pissis, G. Tischler, "Mapping short reads to a genomic sequence with circular structure", in Information Technology and Applications in Biomedicine (ITAB), 2010 10th IEEE International Conference on, pp. 14.

[4]  C. S. Iliopoulos, M. Miller, S. P. Pissis, "Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies", in Proceedings of the Prague Stringology Conference 2009, J. Holub, J. Zdarek, Eds., pp. 249–262.

[3]  P. Antoniou, J. W. Daykin, C. S. Iliopoulos, D. Kourie, L. Mouchard, S. P. Pissis, "Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genome", in Information Technology and Applications in Biomedicine, 2009. ITAB 2009. 9th International Conference on, pp. 14.

[2]  P. Antoniou, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, "Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies", in Bioinformatics, Systems Biology and Intelligent Computing, 2009. IJCBS '09. International Joint Conference on, pp. 174 180.

[1]  S. P. Pissis, "Parallel Fourier Transformations using shared memory nodes", Master's thesis, University of Edinburgh, Edinburgh, 2008.
