The study of the effect that errors may have on computation started at the very beginning of
the history of computer science. It dates back to the early 1950s, to the research by von …

Cartesian tree matching is the problem of finding every substring of a given text which has
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

Background Sequence comparison is a fundamental step in many important tasks in
bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes …

Fully Dynamic de Bruijn Graphs | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

Given a string s, the Parikh vector of s, denoted p (s), counts the multiplicity of each character
in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s …

We introduce efficient data structures for an indexing problem in non-standard stringology—
jumbled pattern matching. Moosa and Rahman J. Discr. Alg., 2012 gave an index for …

Abstract The Graph Motif problem was introduced in 2006 in the context of biological
networks. It consists of deciding whether or not a multiset of colors occurs in a connected …

We introduce a new metric of match, called Cartesian tree matching, which means that two
strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we …

Given two indeterminate equal-length strings p and t with a set of characters per position in
both strings, we obtain a determinate string p_w from p and a determinate string t_w from t …