Degenerate String Comparison and Applications

Abstract : A generalised degenerate string (GD string) S^ is a sequence of n sets of strings of total size N, where the ith set contains strings of the same length k_i but this length can vary between different sets. We denote the sum of these lengths k_0, k_1,...,k_{n-1} by W. This type of uncertain sequence can represent, for example, a gapless multiple sequence alignment of width W in a compact form. Our first result in this paper is an O(N+M)-time algorithm for deciding whether the intersection of two GD strings of total sizes N and M, respectively, over an integer alphabet, is non-empty. This result is based on a combinatorial result of independent interest: although the intersection of two GD strings can be exponential in the total size of the two strings, it can be represented in only linear space. A similar result can be obtained by employing an automata-based approach but its cost is alphabet-dependent. We then apply our string comparison algorithm to compute palindromes in GD strings. We present an O(min{W,n^2}N)-time algorithm for computing all palindromes in S^. Furthermore, we show a similar conditional lower bound for computing maximal palindromes in S^. Finally, proof-of-concept experimental results are presented using real protein datasets.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Marie-France Sagot <>
Submitted on : Sunday, December 23, 2018 - 12:07:01 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Document(s) archivé(s) le : Sunday, March 24, 2019 - 12:51:13 PM


Files produced by the author(s)




Mai Alzamel, Lorraine Ayad, Giulia Bernardini, Roberto Grossi, Costas Iliopoulos, et al.. Degenerate String Comparison and Applications. WABI 2018 - 18th Workshop on Algorithms in Bioinformatics, Aug 2018, Helsinki, Finland. 113, pp.1-14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. 〈10.4230/LIPIcs.WABI.2018.21〉. 〈hal-01964706〉



Record views


Files downloads