Publications

[19] L. A.K. Ayad, G. Loukides, S. P. Pissis, H. Verbeek, "Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast", LATIN 2024 (Accepted).

[18] L. A.K. Ayad, G. Loukides, S. P. Pissis, "Text Indexing for Long Patterns: Anchors are All you Need", Proceedings of the VLDB Endowment 16 (9), pp 2117-2131. [URL]

[17] L. A.K. Ayad, R. Chikhi, S. P. Pissis, "Seedability: optimizing alignment parameters for sensitive sequence comparison", Bioinformatics Advances 3 (1), vbad108. [URL]

[16] L. A.K. Ayad, C. Barton, C. Iliopoulos, Editorial: The 27th London Stringology Days & London Algorithmic Workshop (LSD & LAW) 2019, Theoretical Computer Science, Volume 886, 2021, pp 1-2. [URL]

[15] L. A. K. Ayad, G. Badkobeh, G. Fici, A. Héliou, S. P. Pissis, "Constructing Antidictionaries of Long Texts in Output-Sensitive Space", Theory of Computing Systems, 2021. [URL]

[14] L. A. K. Ayad, A. Dourou, S. Arhondakis, S. P. Pissis, "IsoXpressor: A Tool to Assess Transcriptional Activity within Isochores", Genome Biology and Evolution, vol. 12, Issue 9, 2020, pp. 1573-1578. [URL]

[13] L. A. K. Ayad, P. Charalampopoulos, S. P. Pissis, "SMART: SuperMaximal approximate repeats tool", Bioinformatics, vol. 36, Issue 8, 2020, pp. 2589-2591. [URL]

[12] L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, "Longest property-preserved common factor: A new string-processing framework", Theoretical Computer Science, vol. 812, 2020, pp. 244-251. [URL]

[11] M. Alzamel, L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, "Comparing Degenerate Strings", Fundamenta Informaticae, vol. 175, no. 1-4, 2020, pp. 41-58. [URL]

[10] L. A. K. Ayad, G. Badkobeh, G. Fici, A. Heliou, S. P. Pissis, "Constructing Antidictionaries in Output-Sensitive Space", Data Compression Conference (DCC), 2019, pp. 538-547. [URL]

[9] L. A. K. Ayad, M. Chemillier, S. P. Pissis, "Creating improvisations on chord progressions using suffix trees", Journal of Mathematics and Music, 12:3, pp. 233-247. [URL]

[8] L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, "Longest Property-Preserved Common Factor", SPIRE, Springer, 2018, pp. 42-49. [URL]

[7] L. A. K. Ayad, C. Barton, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "Longest Common Prefixes with k-Errors and Applications", SPIRE, Springer, 2018, pp. 27-41. [URL]

[6] L. A. K. Ayad, S. P. Pissis, D. Polychronopoulos; CNEFinder: finding conserved non-coding elements in genomes, Bioinformatics, Volume 34, Issue 17, 1 September 2018, Pages i743-i747. [URL]

[5] M. Alzamel, L. A. K. Ayad, G. Bernardini, R. Grossi, C. S. Iliopoulos, N. Pisanti, S. P. Pissis, G. Rosone, "Degenerate String Comparison and Applications", in 18th International Workshop on Algorithms in Bioinformatics (WABI 2018), L. Parida, E. Ukkonen, Eds., Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 21:1-21:14. [URL]

[4] H. Alamro, L. A. K. Ayad, P. Charalampopoulos, C. S. Iliopoulos, S. P. Pissis, "Longest Common Prefixes with k-Mismatches and Applications", in SOFSEM 2018: Theory and Practice of Computer Science: 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings, A. M. Tjoa et al., Eds., Cham: Springer International Publishing, pp. 636-649. [URL]

[3] L. A. K. Ayad, C. Barton, S. P. Pissis, "A faster and more accurate heuristic for cyclic edit distance computation", Pattern Recognition Letters, 2017. [URL]

[2] 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. [URL]

[1] L. A. K. Ayad, S. P. Pissis and A. Retha, "libFLASM: a software library for fixed-length approximate string matching", BMC Bioinformatics, vol. 17, no. 1, 2016, pp. 454. [URL]