Background Alignment-free sequence comparison approaches have been garnering
increasing interest in various data-and compute-intensive applications such as phylogenetic …

Alignment-free approaches are gaining persistent interest in many sequence analysis
applications such as phylogenetic inference and metagenomic classification/clustering …

In the longest common substring problem, we are given two strings of length n and must find
a substring of maximal length that occurs in both strings. It is well known that the problem …

We present a novel algorithmic framework for solving approximate sequence matching
problems that permit a bounded total number k of mismatches, insertions, and deletions. The …

The longest common substring (also known as longest common factor) and longest common
subsequence problems are two well-studied classical string problems. The former is …

Background Measuring sequence similarity is central for many problems in bioinformatics. In
several contexts alignment-free techniques based on exact occurrences of substrings are …

Background Various approaches to alignment-free sequence comparison are based on the
length of exact or inexact word matches between pairs of input sequences. Haubold et al.(J …

Background Alignment-free methods for sequence comparisons have become popular in
many bioinformatics applications, specifically in the estimation of sequence similarity …

On Computing Average Common Substring Over Run Length Encoded Sequences Page 1
Fundamenta Informaticae 163 (2018) 267–273 267 DOI 10.3233/FI-2018-1743 IOS Press On …

This paper revisits the-mismatch shortest unique substring finding problem and
demonstrates that a technique recently presented in the context of solving the-mismatch …