Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,162,720 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.
2019
2019
Classification of Audio Codecs in Telecommunication Networks
F. Jafari
2019
Corpus ID: 168166010
Audio data are widely exchanged in telecommunications networks. Due to the limitation of network resources, these data are…
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
2012
2012
Longest Common Substring
S. Khuri
2012
Corpus ID: 125440554
2011
2011
Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts
Shimohira Kouji
,
Inenaga Shunsuke
,
Bannai Hideo
,
Takeda Masayuki
2011
Corpus ID: 125446637
2010
2010
Parallel and Distributed Compressed Indexes
L. Russo
,
G. Navarro
,
Arlindo L. Oliveira
Annual Symposium on Combinatorial Pattern…
2010
Corpus ID: 2901510
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…
Expand
2010
2010
An information retrieval approach to spelling suggestion
S. Krishna
,
Prasad Pingali
,
Vasudeva Varma
The Web Conference
2010
Corpus ID: 570280
In this paper, we present a two-step language-independent spelling suggestion system. In the first step, candidate suggestions…
Expand
2008
2008
Polynomial time algorithms for computing longest common substring and all palindromes from compressed strings
Matsubara Wataru
,
Inenaga Shunsuke
,
Ishino Akira
,
Shinohara Ayumi
,
Nakamura Tomoyuki
,
Hashimoto Kazuo
2008
Corpus ID: 216026480
2008
2008
2 . 3 Formulation 1 : Longest Common Substring
Guilherme Issao Camarinha Fujiwara
,
Pete Kruskall
,
Arkajit Dey
,
Carlos Parda
2008
Corpus ID: 39521256
Evolution has preserved functional elements in the genome. Such elements often manifest themselves as homologues, or similar…
Expand
1998
1998
String Noninclusion Optimization Problems
A. Rubinov
,
V. G. Timkovsky
SIAM Journal on Discrete Mathematics
1998
Corpus ID: 19665538
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a…
Expand
1993
1993
A Partition Approach to Find the Length of the Longest Common Subsequence
Chowdhury S. Rahman
,
Mi Lu
The Sixth International Conference on VLSI Design
1993
Corpus ID: 8092132
In this papcr, we propose a new hardware approach for finding the length of ffie longest common subsequence of two strings. This…
Expand