Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,302 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Computer science
Generalized suffix tree
Joan Feigenbaum
List of algorithms
Expand
Broader (1)
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Improving retrieval performance of translation memories using morphosyntactic analyses and generalized suffix arrays
Melanie Weitz
Machine Translation
2017
Corpus ID: 10982414
Since the 1990s, translation memory (TM) systems have been one of the most widely-used tools in the field of computer-aided…
Expand
2016
2016
Plagiarism Detection in Students ’ Assignments Written in Natural Language
I. Gulis
,
D. Chudá
,
Juraj Petrík
2016
Corpus ID: 45089713
Testing students’ knowledge is crucial aspect for e-learning. However, students are often plagiarising their assignments and…
Expand
2015
2015
Finding Longest Common Substrings in Documents
M.I.Khalil
,
M.A.Hadi
2015
Corpus ID: 55942323
This paper introduces an algorithm to address the problem of finding the longest common substring between two documents. This…
Expand
2014
2014
Semi-automated contour recognition using DICOMautomaton
H. Clark
,
Jonn Wu
,
+4 authors
S. Thomas
2014
Corpus ID: 4954845
Purpose: A system has been developed which recognizes and classifies Digital Imaging and Communication in Medicine contour data…
Expand
2012
2012
Modified genetic algorithms for solving fuzzy flow shop scheduling problems and their implementation with CUDA
Chieh-Sen Huang
,
Yi-Chen Huang
,
Peng-Jen Lai
Expert systems with applications
2012
Corpus ID: 44968444
2011
2011
Computing Longest Common Substring/Subsequence of Non-linear Texts
Kouji Shimohira
,
Shunsuke Inenaga
,
H. Bannai
,
Masayuki Takeda
Prague Stringology Conference
2011
Corpus ID: 10221220
A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we introduce the longest common…
Expand
2008
2008
Computing Longest Common Substring and All Palindromes from Compressed Strings
Wataru Matsubara
,
Shunsuke Inenaga
,
A. Ishino
,
A. Shinohara
,
Tomoyuki Nakamura
,
K. Hashimoto
Conference on Current Trends in Theory and…
2008
Corpus ID: 12423257
This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the…
Expand
2007
2007
Lemmatization of Polish Person Names
J. Piskorski
,
M. Sydow
,
Anna Kupsc
Annual Meeting of the Association for…
2007
Corpus ID: 12161321
The paper presents two techniques for lemmatization of Polish person names. First, we apply a rule-based approach which relies on…
Expand
2005
2005
Linear Time Algorithm for the Generalised Longest Common Repeat Problem
Inbok Lee
,
Y. Pinzón
SPIRE
2005
Corpus ID: 16504855
Given a set of strings $\mathcal{U} = \{T_{1}, T_{2}, . . . , T_{\ell}\}$, the longest common repeat problem is to find the…
Expand
2002
2002
Full-Text Indexes in External Memory
Juha Kärkkäinen
,
S. Rao
Algorithms for Memory Hierarchies
2002
Corpus ID: 884709
A full-text index is a data structure storing a text (a string or a set of strings) and supporting string matching queries: Given…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE