| 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
Theoretical Computer Science | 2022-08-25 | Paper |
A linear time algorithm for the \(r\)-gathering problem on the line
Theoretical Computer Science | 2021-04-14 | Paper |
Multidimensional segment trees can do range updates in poly-logarithmic time
Theoretical Computer Science | 2021-01-25 | Paper |
Searching and indexing circular patterns
Algorithms for Next-Generation Sequencing Data | 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
Fundamenta Informaticae | 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
Journal of Theoretical Biology | 2018-06-07 | Paper |
Solving the minimum common string partition problem with the help of ants
Mathematics in Computer Science | 2017-07-17 | Paper |
Palindromic subsequence automata and longest common palindromic subsequence
Mathematics in Computer Science | 2017-07-17 | Paper |
Enhanced covers of regular and indeterminate strings using prefix tables
| 2017-06-13 | Paper |
Constrained sequence analysis algorithms in computational biology
Information Sciences | 2017-05-16 | Paper |
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
Theoretical Computer Science | 2017-02-06 | Paper |
Indexing a sequence for mapping reads with a single mismatch
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Algorithms for longest common abelian factors
International Journal of Foundations of Computer Science | 2016-11-18 | Paper |
\(V\)-order: new combinatorial properties \& a simple comparison algorithm
Discrete Applied Mathematics | 2016-10-07 | Paper |
Computing covers using prefix tables
Discrete Applied Mathematics | 2016-09-12 | Paper |
The swap matching problem revisited
Theoretical Computer Science | 2016-06-27 | Paper |
Simple linear comparison of strings in \(V\)-order
Fundamenta Informaticae | 2016-05-11 | Paper |
Approximation algorithms for three dimensional protein folding
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Pancake flipping and sorting permutations
Journal of Discrete Algorithms | 2015-08-18 | Paper |
Prefix and suffix transreversals on binary and ternary strings
Journal of Discrete Algorithms | 2015-08-18 | Paper |
Inferring an indeterminate string from a prefix graph
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Computing a Longest Common Palindromic Subsequence
Lecture Notes in Computer Science | 2014-08-19 | Paper |
A graph theoretic model to solve the approximate string matching problem allowing for translocations
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Journal of Discrete Algorithms | 2014-08-13 | Paper |
A graph-theoretic model to solve the approximate string matching problem allowing for translocations
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Computing a longest common palindromic subsequence
Fundamenta Informaticae | 2014-04-25 | Paper |
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
Information Processing Letters | 2014-04-11 | Paper |
Simple linear comparison of strings in \(V\)-order (extended abstract)
Algorithms and Computation | 2014-02-18 | Paper |
Protein Folding in 2D-Triangular Lattice Revisited
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Inferring strings from cover arrays
Discrete Mathematics, Algorithms and Applications | 2013-09-05 | Paper |
On palindromic sequence automata and applications
Implementation and Application of Automata | 2013-08-07 | Paper |
Prefix transpositions on binary and ternary strings
Information Processing Letters | 2013-06-28 | Paper |
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time
Journal of Discrete Algorithms | 2013-06-24 | Paper |
scientific article; zbMATH DE number 6146456 (Why is no real title available?)
| 2013-03-19 | Paper |
DesynchLRU: an efficient page replacement algorithm with desynchronized cache and RAM
| 2012-08-29 | Paper |
Improved algorithms for the point-set embeddability problem for plane 3-trees
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Doubly-constrained LCS and hybrid-constrained LCS problems revisited
Information Processing Letters | 2012-07-25 | Paper |
Improved algorithms for the range next value problem and applications
Theoretical Computer Science | 2012-06-25 | Paper |
Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Sub-quadratic time and linear space data structures for permutation matching in binary strings
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Indeterminate string inference algorithms
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Indexing permutations for binary strings
Information Processing Letters | 2012-03-27 | Paper |
Improved algorithms for the point-set embeddability problem for plane 3-trees
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Finding patterns in given intervals
Fundamenta Informaticae | 2011-06-14 | Paper |
Solving the generalized subset sum problem with a light based device
Natural Computing | 2011-05-23 | Paper |
Cache oblivious algorithms for the RMQ and the RMSQ problems
Mathematics in Computer Science | 2011-02-19 | Paper |
Optimal prefix and suffix queries on texts
| 2010-08-02 | Paper |
Optimal prefix and suffix queries on texts
Information Processing Letters | 2010-06-09 | Paper |
Algorithms for two versions of LCS problem for indeterminate strings
| 2010-06-07 | Paper |
Finite automata based algorithms on subsequences and supersequences of degenerate strings
Journal of Discrete Algorithms | 2010-05-25 | Paper |
New efficient algorithms for the LCS and constrained LCS problems
Information Processing Letters | 2010-04-19 | Paper |
Faster index for property matching
Information Processing Letters | 2010-03-24 | Paper |
The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On Hamiltonian cycles and Hamiltonian paths
Information Processing Letters | 2009-12-04 | Paper |
Complexities of some interesting problems on spanning trees
Information Processing Letters | 2009-12-04 | Paper |
A new efficient algorithm for computing the longest common subsequence
Theory of Computing Systems | 2009-10-19 | Paper |
Indexing factors with gaps
Algorithmica | 2009-07-24 | Paper |
Maximum Neighbour Voronoi Games
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
IDENTIFYING RHYTHMS IN MUSICAL TEXTS
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Finding Patterns in Given Intervals
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
Mathematics in Computer Science | 2008-09-08 | Paper |
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science | 2008-07-10 | Paper |
Algorithms for Computing the Longest Parameterized Common Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
The Constrained Longest Common Subsequence Problem for Degenerate Strings
Implementation and Application of Automata | 2008-06-10 | Paper |
Algorithms for Computing Variants of the Longest Common Subsequence Problem
Algorithms and Computation | 2008-04-24 | Paper |
Indexing Circular Patterns
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Indexing Factors with Gaps
Lecture Notes in Computer Science | 2008-03-07 | Paper |
A New Efficient Algorithm for Computing the Longest Common Subsequence
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Finding Patterns with Variable Length Gaps or Don’t Cares
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
Computers & Operations Research | 2006-06-30 | Paper |
scientific article; zbMATH DE number 2157456 (Why is no real title available?)
| 2005-04-15 | Paper |
