Author of the publication

Approximate Abelian Periods to Find Motifs in Biological Sequences.

, , , and . CIBB, volume 8623 of Lecture Notes in Computer Science, page 121-130. Springer, (2014)

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.

 

Other publications of authors with the same name

Finding overlaps within regular expressions with variable-length gaps., , and . RACS, page 16-21. ACM, (2013)Parameterized Matching: Solutions and Extensions., and . Stringology, page 118-131. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2015)A Multiobjective Approach to the Weighted Longest Common Subsequence Problem., , and . Stringology, page 64-74. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2012)Approximate Function Matching under δ- and γ- Distances., , and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)delta-gamma-Parameterized Matching., , and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 236-248. Springer, (2008)Solving Graph Isomorphism Using Parameterized Matching., , , , , and . SPIRE, volume 8214 of Lecture Notes in Computer Science, page 230-242. Springer, (2013)Approximate Abelian Periods to Find Motifs in Biological Sequences., , , and . CIBB, volume 8623 of Lecture Notes in Computer Science, page 121-130. Springer, (2014)Segment and Fenwick Trees for Approximate Order Preserving Matching., , , and . WEA, volume 742 of Communications in Computer and Information Science, page 131-143. Springer, (2017)