A linear time algorithm for consecutive permutation pattern matching

scholarly article by M. Kubica et al published June 2013 in Information Processing Letters

A note on efficient computation of all Abelian periods in a string

scholarly article by Maxime Crochemore et al published February 2013 in Information Processing Letters

A note on the longest common compatible prefix problem for partial words

Brickworx builds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps

scientific article

ClaRNA: a classifier of contacts in RNA 3D structures based on a comparative analysis of various classification schemes

scientific article

Computing the Longest Previous Factor

Covering Problems for Partial Words and for Indeterminate Strings

Efficient enumeration of non-equivalent squares in partial words with few holes

Efficient seed computation revisited

Extracting powers and periods in a word from its runs structure

Fast Algorithm for Partial Covers in Words

Finding Patterns In Given Intervals

scientific article published in 2010

Improved algorithms for the range next value problem and applications

article

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

New simple efficient algorithms computing powers and runs in strings

On the Maximal Number of Cubic Runs in a String

Order-preserving indexing

RNA Bricks--a database of RNA 3D motifs and their interactions

scientific article

Shortest Covers of All Cyclic Shifts of a String

scientific article published in 2020

String Powers in Trees

SupeRNAlign: a new tool for flexible superposition of homologous RNA structures and inference of accurate structure-based sequence alignments

scientific article published in September 2017

The maximal number of cubic runs in a word