| Publication | Date of Publication | Type |
|---|
| QT-GILD: Quartet based gene tree imputation using deep learning improves phylogenomic analyses despite missing data | 2022-08-30 | Paper |
| Computing the longest common almost-increasing subsequence | 2022-08-25 | Paper |
| A linear time algorithm for the \(r\)-gathering problem on the line | 2021-04-14 | Paper |
| Multidimensional segment trees can do range updates in poly-logarithmic time | 2021-01-25 | Paper |
| Searching and Indexing Circular Patterns | 2020-08-07 | Paper |
| A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract) | 2019-10-15 | Paper |
| Applications of \(V\)-order: suffix arrays, the Burrows-Wheeler transform \& the FM-index | 2019-10-15 | Paper |
| Approximation Algorithms for Three Dimensional Protein Folding | 2019-03-01 | Paper |
| A simple, fast, filter-based algorithm for circular sequence comparison | 2018-06-15 | Paper |
| On multiple longest common subsequence and common motifs with gaps (extended abstract) | 2018-06-15 | Paper |
| RBSURFpred: modeling protein accessible surface area in real and binary space using regularized and optimized regression | 2018-06-07 | Paper |
| Palindromic subsequence automata and longest common palindromic subsequence | 2017-07-17 | Paper |
| Solving the minimum common string partition problem with the help of ants | 2017-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5267518 | 2017-06-13 | Paper |
| Constrained sequence analysis algorithms in computational biology | 2017-05-16 | Paper |
| An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications | 2017-02-06 | Paper |
| Indexing a sequence for mapping reads with a single mismatch | 2017-01-13 | Paper |
| Algorithms for Longest Common Abelian Factors | 2016-11-18 | Paper |
| \(V\)-order: new combinatorial properties \& a simple comparison algorithm | 2016-10-07 | Paper |
| Computing covers using prefix tables | 2016-09-12 | Paper |
| The swap matching problem revisited | 2016-06-27 | Paper |
| Simple Linear Comparison of Strings in V-order* | 2016-05-11 | Paper |
| Approximation Algorithms for Three Dimensional Protein Folding | 2016-05-03 | Paper |
| Pancake flipping and sorting permutations | 2015-08-18 | Paper |
| Prefix and suffix transreversals on binary and ternary strings | 2015-08-18 | Paper |
| Inferring an indeterminate string from a prefix graph | 2015-05-04 | Paper |
| A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations | 2014-08-19 | Paper |
| Computing a Longest Common Palindromic Subsequence | 2014-08-19 | Paper |
| Computing a longest common subsequence that is almost increasing on sequences having no repeated elements | 2014-08-13 | Paper |
| A graph-theoretic model to solve the approximate string matching problem allowing for translocations | 2014-08-13 | Paper |
| Computing a Longest Common Palindromic Subsequence | 2014-04-25 | Paper |
| A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem | 2014-04-11 | Paper |
| Simple Linear Comparison of Strings in V-Order | 2014-02-18 | Paper |
| Protein Folding in 2D-Triangular Lattice Revisited | 2014-01-17 | Paper |
| INFERRING STRINGS FROM COVER ARRAYS | 2013-09-05 | Paper |
| On Palindromic Sequence Automata and Applications | 2013-08-07 | Paper |
| Prefix transpositions on binary and ternary strings | 2013-06-28 | Paper |
| The substring inclusion constraint longest common subsequence problem can be solved in quadratic time | 2013-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910720 | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2909024 | 2012-08-29 | Paper |
| IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES | 2012-08-27 | Paper |
| Doubly-constrained LCS and hybrid-constrained LCS problems revisited | 2012-07-25 | Paper |
| Improved algorithms for the range next value problem and applications | 2012-06-25 | Paper |
| Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet | 2012-06-08 | Paper |
| Sub-quadratic time and linear space data structures for permutation matching in binary strings | 2012-05-11 | Paper |
| Indeterminate string inference algorithms | 2012-05-11 | Paper |
| Indexing permutations for binary strings | 2012-03-27 | Paper |
| Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees | 2011-08-17 | Paper |
| Finding Patterns In Given Intervals | 2011-06-14 | Paper |
| Solving the generalized subset sum problem with a light based device | 2011-05-23 | Paper |
| Cache oblivious algorithms for the RMQ and the RMSQ problems | 2011-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576753 | 2010-08-02 | Paper |
| Optimal prefix and suffix queries on texts | 2010-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565916 | 2010-06-07 | Paper |
| Finite automata based algorithms on subsequences and supersequences of degenerate strings | 2010-05-25 | Paper |
| New efficient algorithms for the LCS and constrained LCS problems | 2010-04-19 | Paper |
| Faster index for property matching | 2010-03-24 | Paper |
| The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time | 2010-02-09 | Paper |
| On Hamiltonian cycles and Hamiltonian paths | 2009-12-04 | Paper |
| Complexities of some interesting problems on spanning trees | 2009-12-04 | Paper |
| A new efficient algorithm for computing the longest common subsequence | 2009-10-19 | Paper |
| Indexing factors with gaps | 2009-07-24 | Paper |
| Maximum Neighbour Voronoi Games | 2009-02-24 | Paper |
| IDENTIFYING RHYTHMS IN MUSICAL TEXTS | 2008-11-03 | Paper |
| Finding Patterns in Given Intervals | 2008-09-17 | Paper |
| A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching | 2008-09-08 | Paper |
| Algorithms for computing variants of the longest common subsequence problem | 2008-07-10 | Paper |
| Algorithms for Computing the Longest Parameterized Common Subsequence | 2008-06-17 | Paper |
| The Constrained Longest Common Subsequence Problem for Degenerate Strings | 2008-06-10 | Paper |
| Algorithms for Computing Variants of the Longest Common Subsequence Problem | 2008-04-24 | Paper |
| Indexing Circular Patterns | 2008-03-25 | Paper |
| A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns | 2008-03-07 | Paper |
| Indexing Factors with Gaps | 2008-03-07 | Paper |
| A New Efficient Algorithm for Computing the Longest Common Subsequence | 2008-01-04 | Paper |
| Finding Patterns with Variable Length Gaps or Don’t Cares | 2007-09-10 | Paper |
| Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4670065 | 2005-04-15 | Paper |
