( en | de | ru )

 

Disambiguation of "Iliopoulos, Costas S."

Author of the publication

copydeleteadd this publication to your clipboard
Finding Patterns with Variable Length Gaps or Don't Cares.

, , , , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 146-155. Springer, (2006)

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

External Memory Algorithms for String Problems., , , and . Fundam. Informaticae, 84 (1): 17-32 (2008)A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching., , and . Math. Comput. Sci., 1 (4): 557-569 (2008)Fast circular dictionary-matching algorithm., , , , , , and . Math. Struct. Comput. Sci., 27 (2): 143-156 (2017)Optimal computation of all tandem repeats in a weighted sequence., , and . Algorithms Mol. Biol., (2014)A Work-Time Optimal Algorithm for Computing All String Covers., and . Theor. Comput. Sci., 164 (1&2): 299-310 (1996)Linear-time superbubble identification algorithm for genome assembly., , , , , and . Theor. Comput. Sci., (2016)Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore., and . Theor. Comput. Sci., 410 (43): 4293-4294 (2009)Longest repeats with a block of k don't cares., , , and . Theor. Comput. Sci., 362 (1-3): 248-254 (2006)Covering a String., , and . CPM, volume 684 of Lecture Notes in Computer Science, page 54-62. Springer, (1993)Algorithms for Computing Variants of the Longest Common Subsequence Problem., and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 399-408. Springer, (2006)