Publications

Filter by type:

. On the string consensus problem and the Manhattan sequence consensus problem. Theoretical Computer Science 710:126-138, 2018.

Details Publisher version ArXiv

. Efficient algorithms for shortest partial seeds in words. Theoretical Computer Science 710:139-147, 2018.

Details Publisher version

. String Periods in the Order-Preserving Model. STACS, 2018.

Details ArXiv

. On Periodicity Lemma for Partial Words. LATA, 2018.

Details ArXiv

. Covering problems for partial words and for indeterminate strings. Theoretical Computer Science 698:25-39, 2017.

Details Publisher version ArXiv

. String Powers in Trees. Algorithmica 79(3):814-834, 2017.

Details Publisher version Conference version

. Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON pp:99-111, 2017.

Details Publisher version

. On the String Consensus Problem and the Manhattan Sequence Consensus Problem. TCS, 2017.

Details Publisher version ArXiv Conference version

. Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE pp:22-34, 2016.

Details Publisher version ArXiv

. Maximum number of distinct and nonequivalent nonstandard squares in a word. Theoretical Computer Science 648:84-95, 2016.

Details Publisher version ArXiv Conference version

. Faster Longest Common Extension Queries in Strings over General Alphabets. CPM pp:5:1-5:13, 2016.

Details Publisher version ArXiv BibTeX Slides

. Order-preserving indexing. Theoretical Computer Science 638:122-135, 2016.

Details Publisher version BibTeX Conference version

. Polynomial-time approximation algorithms for weighted LCS problem. Discrete Applied Mathematics 204:38-48, 2016.

Details Publisher version BibTeX Conference version

. On the greedy algorithm for the Shortest Common Superstring problem with reversals. Information Processing Letters 116(3):245-251, 2015.

Details Publisher version ArXiv BibTeX

. Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theoretical Computer Science 602:7-21, 2015.

Details Publisher version BibTeX Conference version

. Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE pp:270-276, 2015.

Details Publisher version BibTeX

. Efficient Algorithms for Longest Closed Factor Array. SPIRE pp:95-102, 2015.

Details Publisher version BibTeX

. A note on the longest common compatible prefix problem for partial words. Journal of Discrete Algorithms 34:49-53, 2015.

Details Publisher version ArXiv BibTeX

. Universal Reconstruction of a String. WADS pp:386-397, 2015.

Details Publisher version BibTeX

. Fast Algorithm for Partial Covers in Words. Algorithmica 73(1):217-233, 2015.

Details Publisher version ArXiv BibTeX Conference version

. String Powers in Trees. CPM pp:284-294, 2015.

Details Publisher version BibTeX Full journal version

. Internal Pattern Matching Queries in a Text and Applications. SODA pp:532-551, 2015.

Details Publisher version BibTeX

. Covering Problems for Partial Words and for Indeterminate Strings. ISAAC pp:220-232, 2014.

Details Publisher version ArXiv BibTeX

. On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE pp:244-255, 2014.

Details Publisher version ArXiv BibTeX Full journal version

. Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory pp:215-226, 2014.

Details Publisher version ArXiv BibTeX Slides Full journal version

. New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics 163:258-267, 2014.

Details Publisher version BibTeX Conference version

. Efficient counting of square substrings in a tree. Theoretical Computer Science 544:60-73, 2014.

Details Publisher version BibTeX Conference version

. Efficient Algorithms for Shortest Partial Seeds in Words. CPM pp:192-201, 2014.

Details Publisher version BibTeX

. RNA Bricks - a database of RNA 3D motifs and their interactions. Nucleic Acids Research 42(Database-Issue):123-131, 2014.

Details Publisher version BibTeX

. Extracting powers and periods in a word from its runs structure. Theoretical Computer Science 521:29-41, 2014.

Details Publisher version BibTeX Conference version

. Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. arXiv CoRR abs/1311.6235, 2013.

Details Publisher version PDF BibTeX

. Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE pp:84-95, 2013.

Details Publisher version ArXiv BibTeX Slides Full journal version

. A linear time algorithm for consecutive permutation pattern matching. Information Processing Letters 113(12):430-433, 2013.

Details Publisher version PDF BibTeX

. Fast Algorithm for Partial Covers in Words. CPM pp:177-188, 2013.

Details Publisher version PDF ArXiv BibTeX Slides by TK Full journal version

. Efficient seed computation revisited. Theoretical Computer Science 483:171-181, 2013.

Details Publisher version BibTeX Conference version

. Efficient Counting of Square Substrings in a Tree. ISAAC pp:207-216, 2013.

Details Publisher version BibTeX Slides by JP Full journal version

. A note on efficient computation of all Abelian periods in a string. Information Processing Letters 113(3):74-77, 2013.

Details Publisher version ArXiv BibTeX

. A linear time algorithm for seeds computation. SODA pp:1095-1112, 2012.

Details Publisher version ArXiv BibTeX Slides by TK

. Improved algorithms for the range next value problem and applications. Theoretical Computer Science 434:23-34, 2012.

Details Publisher version BibTeX Conference version

. The maximal number of cubic runs in a word. Journal of Computer and System Sciences 78(6):1828-1836, 2012.

Details Publisher version BibTeX Conference version

. On the maximum number of cubic subwords in a word. European Journal of Combinatorics 34(1):27-37, 2012.

Details Publisher version BibTeX

. Computing the Longest Previous Factor. European Journal of Combinatorics 34(1):15-26, 2012.

Details Publisher version BibTeX Conference version

. Efficient Data Structures for the Factor Periodicity Problem. SPIRE pp:284-294, 2012.

Details Publisher version BibTeX Slides by TK

. On the maximal sum of exponents of runs in a string. Journal of Discrete Algorithms 14:29-36, 2012.

Details Publisher version ArXiv BibTeX

. The Maximum Number of Squares in a Tree. CPM pp:27-40, 2012.

Details Publisher version PDF BibTeX Slides by TK

. Efficient algorithms for three variants of the LPF table. Journal of Discrete Algorithms 11:51-61, 2012.

Details Publisher version BibTeX

. Approximation of RNA multiple structural alignment. Journal of Discrete Algorithms 9(4):365-376, 2011.

Details Publisher version BibTeX Conference version

. Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM pp:455-466, 2011.

Details Publisher version PDF BibTeX Slides Full journal version

. Efficient Seeds Computation Revisited. CPM pp:350-363, 2011.

Details Publisher version ArXiv BibTeX Slides by JR Full journal version

. On the Maximal Sum of Exponents of Runs in a String. IWOCA pp:10-19, 2011.

Details Publisher version PDF ArXiv BibTeX

. Improved induced matchings in sparse graphs. Discrete Applied Mathematics 158(18):1994-2003, 2010.

Details Publisher version BibTeX Conference version

. Finding Patterns In Given Intervals. Fundamenta Informaticae 101(3):173-186, 2010.

Details Publisher version PDF BibTeX

. Extracting Powers and Periods in a String from Its Runs Structure. SPIRE pp:258-269, 2010.

Details Publisher version PDF BibTeX Slides by JR Full journal version

. Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM pp:299-309, 2010.

Details Publisher version PDF BibTeX

. On the Maximal Number of Cubic Runs in a String. LATA pp:227-238, 2010.

Details Publisher version ArXiv BibTeX Full journal version

. New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology pp:138-149, 2010.

Details Publisher version BibTeX Full journal version

. Improved Algorithms for the Range Next Value Problem and Applications. STACS pp:205-216, 2010.

Details Publisher version PDF BibTeX Slides Full journal version

. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM pp:296-307, 2009.

Details Publisher version PDF BibTeX Slides by MK

. Improved Induced Matchings in Sparse Graphs. IWPEC pp:134-148, 2009.

Details Publisher version BibTeX Slides Full journal version

. On the Maximal Number of Cubic Subwords in a String. IWOCA pp:345-355, 2009.

Details Publisher version ArXiv BibTeX Slides by JR

. LPF Computation Revisited. IWOCA pp:158-169, 2009.

Details Publisher version BibTeX Full journal version

. Algorithms for Computing the Longest Parameterized Common Subsequence. CPM pp:265-273, 2007.

Details Publisher version BibTeX Slides by MK

. Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics 155(3):327-336, 2007.

Details Publisher version BibTeX

. RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization 13(2):179-188, 2007.

Details Publisher version BibTeX

. Approximation of RNA Multiple Structural Alignment. CPM pp:211-222, 2006.

Details Publisher version BibTeX Slides Full journal version

. New Course Registration Module for the University Study-Oriented System. The 10th International Conference of European University Information Systems, EUNIS, 2004.

Details