Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Longest Property-Preserved Common Factor.

L. Ayad, G. Bernardini, R. Grossi, C. Iliopoulos, N. Pisanti, S. Pissis, and G. Rosone. SPIRE, volume 11147 of Lecture Notes in Computer Science, page 42-49. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ivan Solonenko University of Stuttgart

P. Hommel

P. Abegglen

P. Krasteva

P. E. Bl\"ochl

Other publications of authors with the same name

Preface.P. Charalampopoulos, M. Crochemore, and S. Pissis. Fundam. Inform., 163 (3): i (2018)An algorithm for mapping short reads to a dynamically changing genomic sequence.C. Iliopoulos, D. Kourie, L. Mouchard, T. Musombuka, S. Pissis, and C. de Ridder. J. Discrete Algorithms, (2012)A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies.C. Iliopoulos, L. Mouchard, and S. Pissis. PARCO, volume 19 of Advances in Parallel Computing, page 150-157. IOS Press, (2009)Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome.C. Iliopoulos, M. Miller, and S. Pissis. Int. J. Found. Comput. Sci., 23 (2): 249-259 (2012)New and Efficient Approaches to the Quasiperiodic Characterisation of a String.T. Flouri, C. Iliopoulos, T. Kociumaka, S. Pissis, S. Puglisi, W. Smyth, and W. Tyczynski. Stringology, page 75-88. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2012)String Sanitization: A Combinatorial Approach.G. Bernardini, H. Chen, A. Conte, R. Grossi, G. Loukides, N. Pisanti, S. Pissis, and G. Rosone. CoRR, (2019)Linear-Time Algorithm for Long LCF with k Mismatches.P. Charalampopoulos, M. Crochemore, C. Iliopoulos, T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, and T. Walen. CPM, volume 105 of LIPIcs, page 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Cover Array String Reconstruction.M. Crochemore, C. Iliopoulos, S. Pissis, and G. Tischler. CPM, volume 6129 of Lecture Notes in Computer Science, page 251-259. Springer, (2010)Longest Common Substring Made Fully Dynamic.A. Amir, P. Charalampopoulos, S. Pissis, and J. Radoszewski. ESA, volume 144 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Average-Case Optimal Approximate Circular String Matching.C. Barton, C. Iliopoulos, and S. Pissis. LATA, volume 8977 of Lecture Notes in Computer Science, page 85-96. Springer, (2015)