Small Longest Tandem Scattered Subsequences
We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm, therefore its performance improves if the string is not self s...
Main Authors: | Luıs M. S. Russo, Alexandre P. Francisco |
---|---|
Format: | Article |
Language: | English |
Published: |
Alexandru Ioan Cuza University of Iasi
2021-08-01
|
Series: | Scientific Annals of Computer Science |
Subjects: | |
Online Access: | https://www.info.uaic.ro/en/sacs_articles/small-longest-tandem-scattered-subsequences/ |
Similar Items
-
The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
by: Al-Meanazel, Ayat
Published: (2015) -
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
by: Elizabeth J. Itskovich, et al.
Published: (2019-11-01) -
Using the longest run subsequence problem within homology-based scaffolding
by: Goel, M., et al.
Published: (2021) -
Using the longest run subsequence problem within homology-based scaffolding
by: Sven Schrinner, et al.
Published: (2021-06-01) -
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
by: Zhan Peng, et al.
Published: (2017-08-01)