Semi-local string comparison: Algorithmic techniques and applications
A Tiskin - Mathematics in Computer Science, 2008 - Springer
Given two strings, the longest common subsequence (LCS) problem consists in computing
the length of the longest string that is a subsequence of both input strings. Its generalisation …
the length of the longest string that is a subsequence of both input strings. Its generalisation …
[HTML][HTML] Semi-local longest common subsequences in subquadratic time
A Tiskin - Journal of Discrete Algorithms, 2008 - Elsevier
For two strings a, b of lengths m, n, respectively, the longest common subsequence (LCS)
problem consists in comparing a and b by computing the length of their LCS. In this paper …
problem consists in comparing a and b by computing the length of their LCS. In this paper …
A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
CER Alves, EN Caceres, SW Song - Algorithmica, 2006 - Springer
Given two strings A and B of lengths na and nb, respectively, the All-substrings Longest
Common Subsequence (ALCS) problem obtains, for any substring B'of B, the length of the …
Common Subsequence (ALCS) problem obtains, for any substring B'of B, the length of the …
[HTML][HTML] An all-substrings common subsequence algorithm
CER Alves, EN Cáceres, SW Song - Discrete Applied Mathematics, 2008 - Elsevier
Given two strings A and B of lengths na and nb, na⩽ nb, respectively, the all-substrings
longest common subsequence (ALCS) problem obtains, for every substring B′ of B, the …
longest common subsequence (ALCS) problem obtains, for every substring B′ of B, the …
Faster subsequence recognition in compressed strings
A Tiskin - Journal of Mathematical Sciences, 2009 - Springer
Computation on compressed strings is one of the key approaches to processing massive
data sets. We consider local subsequence recognition problems on strings compressed by …
data sets. We consider local subsequence recognition problems on strings compressed by …
Longest common subsequences in permutations and maximum cliques in circle graphs
A Tiskin - Annual Symposium on Combinatorial Pattern Matching, 2006 - Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing
a and b by computing the length of their LCS. In a previous paper, we defined a …
a and b by computing the length of their LCS. In a previous paper, we defined a …
An almost quadratic time algorithm for sparse spliced alignment
Y Sakai - Theory of Computing Systems, 2011 - Springer
The sparse spliced alignment problem consists of finding a chain of zero or more exons from
O (n) prescribed candidate exons of a DNA sequence of length O (n) that is most similar to a …
O (n) prescribed candidate exons of a DNA sequence of length O (n) that is most similar to a …
Linear-space S-table algorithms for the longest common subsequence problem
BS Lin, KS Huang, CB Yang - Theoretical Computer Science, 2023 - Elsevier
Given two sequences A and B of lengths m and n, respectively, the consecutive suffix
alignment (CSA) problem is to compute the longest common subsequence (LCS) between A …
alignment (CSA) problem is to compute the longest common subsequence (LCS) between A …
[HTML][HTML] A fast algorithm for multiplying min-sum permutations
Y Sakai - Discrete applied mathematics, 2011 - Elsevier
The present article considers the problem for determining, for given two permutations over
indices from 1 to n, the permutation whose distribution matrix is identical to the min-sum …
indices from 1 to n, the permutation whose distribution matrix is identical to the min-sum …
All semi-local longest common subsequences in subquadratic time
A Tiskin - International Computer Science Symposium in Russia, 2006 - Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS)
problem consists in comparing a and b by computing the length of their LCS. In this paper …
problem consists in comparing a and b by computing the length of their LCS. In this paper …