Author of the publication

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)

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

A multiobjective optimization algorithm for the weighted LCS., , and . Discrete Applied Mathematics, (2016)Practical algorithms for transposition-invariant string-matching., , and . J. Discrete Algorithms, 3 (2-4): 267-292 (2005)Pattern-Matching with Bounded Gaps in Genomic Sequences., and . Revista Colombiana de Computación, 10 (1): 110-119 (2009)A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval., , , and . SPIRE, volume 2857 of Lecture Notes in Computer Science, page 211-223. Springer, (2003)A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem., , and . IJCOPI, 4 (3): 2-10 (2013)Approximate String Matching in Musical Sequences., , , and . Stringology, page 26-36. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2001)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)Computing Approximate Repetitions in Musical Sequences., , , and . Stringology, page 49-59. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2000)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)New Bit-Parallel Indel-Distance Algorithm., , and . WEA, volume 3503 of Lecture Notes in Computer Science, page 380-390. Springer, (2005)