scholarly journals A note on the longest common substring with k-mismatches problem

2015 ◽  
Vol 115 (6-8) ◽  
pp. 640-642 ◽  
Author(s):  
Szymon Grabowski
Keyword(s):  
Longest Common Substring

The longest common substring problem

2015 ◽  
Vol 27 (2) ◽  
pp. 277-295 ◽  
Author(s):  
MAXIME CROCHEMORE ◽  
COSTAS S. ILIOPOULOS ◽  
ALESSIO LANGIU ◽  
FILIPPO MIGNOSI
Keyword(s):  
Data Structures ◽  
Dna Sequences ◽  
Simple Algorithm ◽  
Suffix Trees ◽  
Simple Method ◽  
Suffix Arrays ◽  
Lowest Common Ancestor ◽  
Wide Range ◽  
Efficient Data ◽  
Longest Common Substring

Given a set $\mathcal{D}$ of q documents, the Longest Common Substring (LCS) problem asks, for any integer 2 ⩽ k ⩽ q, the longest substring that appears in k documents. LCS is a well-studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences alignments and analysis. This problem has been solved by Hui (2000International Journal of Computer Science and Engineering15 73–76) by using a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with the use of suffix trees.In this article, we present a simple method for solving the LCS problem by using suffix trees (STs) and classical union-find data structures. In turn, we show how this simple algorithm can be adapted in order to work with other space efficient data structures such as the enhanced suffix arrays (ESA) and the compressed suffix tree.

scholarly journals Longest Common Substring with Approximately k Mismatches

Algorithmica ◽  
2019 ◽  
Vol 81 (6) ◽  
pp. 2633-2652 ◽  
Author(s):  
Tomasz Kociumaka ◽  
Jakub Radoszewski ◽  
Tatiana Starikovskaya
Keyword(s):  
Longest Common Substring

scholarly journals Efficient watermark detection by using the longest common substring technique

2011 ◽  
Vol 12 (2) ◽  
pp. 115-123 ◽  
Author(s):  
Taha M. Mohamed ◽  
Hesham N. Elmahdy ◽  
Hoda M. Onsi
Keyword(s):  
Longest Common Substring

Computing the longest common substring with one mismatch

2011 ◽  
Vol 47 (1) ◽  
pp. 28-33 ◽  
Author(s):  
M. A. Babenko ◽  
T. A. Starikovskaya
Keyword(s):  
Longest Common Substring

scholarly journals Methodology for the Assessment of the Text Similarity of Documents in the CORE Open Access Data Set of Scholarly Documents

2021 ◽  
Author(s):  
Ivan Kovačič ◽  
David Bajs ◽  
Milan Ojsteršek
Keyword(s):  
Second Step ◽  
Plagiarism Detection ◽  
Text Similarity ◽  
Data Set ◽  
The Core ◽  
Metadata Enrichment ◽  
Feature Based ◽  
Longest Common Substring ◽  
Hashing Algorithm ◽  
Access Data

This paper describes the methodology of data preparation and analysis of the text similarity required for plagiarism detection on the CORE data set. Firstly, we used the CrossREF API and Microsoft Academic Graph data set for metadata enrichment and elimination of duplicates of doc-uments from the CORE 2018 data set. In the second step, we used 4-gram sequences of words from every document and transformed them into SHA-256 hash values. Features retrieved using hashing algorithm are compared, and the result is a list of documents and the percentages of cov-erage between pairs of documents features. In the third step, called pairwise feature-based ex-haustive analysis, pairs of documents are checked using the longest common substring.

scholarly journals Sublinear Space Algorithms for the Longest Common Substring Problem

2014 ◽  
pp. 605-617 ◽  
Author(s):  
Tomasz Kociumaka ◽  
Tatiana Starikovskaya ◽  
Hjalte Wedel Vildhøj
Keyword(s):  
Longest Common Substring
Sign in / Sign up

Export Citation Format

Share Document