Longest common substring problem

Known as: Longest common substring, Longest common subword, Longest-common substring problem

In computer science, the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Since the 1990s, translation memory (TM) systems have been one of the most widely-used tools in the field of computer-aided…

2016

Testing students’ knowledge is crucial aspect for e-learning. However, students are often plagiarising their assignments and…

2015

This paper introduces an algorithm to address the problem of finding the longest common substring between two documents. This…

2014

Purpose: A system has been developed which recognizes and classifies Digital Imaging and Communication in Medicine contour data…

2012

2011

A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we introduce the longest common…

2008

This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the…

2007

The paper presents two techniques for lemmatization of Polish person names. First, we apply a rule-based approach which relies on…

2005

Given a set of strings $\mathcal{U} = \{T_{1}, T_{2}, . . . , T_{\ell}\}$, the longest common repeat problem is to find the…

2002

A full-text index is a data structure storing a text (a string or a set of strings) and supporting string matching queries: Given…