( en | de | ru )

 

Disambiguation of "Iliopoulos, Costas S."

Author of the publication

copydeleteadd this publication to your clipboard
An algorithm for mapping short reads to a dynamically changing genomic sequence.

, , , , , and . J. Discrete Algorithms, (2012)

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.

Christos Iliopoulos

Nikolaos Iliopoulos

Peter Costas

Costas Averkiou

Costas Higoumenakis

 

Other publications of authors with the same name

Exact and approximate rhythm matching algorithms., , , and . Int. J. Digit. Libr., 12 (2-3): 149-158 (2012)Property Suffix Array with Applications., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 290-302. Springer, (2018)Efficient Identification of k-Closed Strings., , , , , and . EANN, volume 744 of Communications in Computer and Information Science, page 583-595. Springer, (2017)Finding the Anticover of a String., , , , , , and . CPM, volume 161 of LIPIcs, page 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Generalized approximate regularities in strings., , and . Int. J. Comput. Math., 85 (2): 155-168 (2008)Application and Algorithm: Maximal Motif Discovery for Biological Data in a Sliding Window., , , and . AIAI Workshops, volume 585 of IFIP Advances in Information and Communication Technology, page 213-224. Springer, (2020)Conservative String Covering of Indeterminate Strings., , , , and . Stringology, page 108-115. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)Effective Solutions for Most Common Vulnerabilities in Web Applications., , and . IntelliSys (2), volume 16 of Lecture Notes in Networks and Systems, page 738-754. Springer, (2016)Approximate periods of strings., , , and . Theor. Comput. Sci., 262 (1): 557-568 (2001)GenMap: ultra-fast computation of genome mappability., , , and . Bioinform., 36 (12): 3687-3692 (2020)