On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications.

Mladen Kovacevic

Published in: Probl. Inf. Transm. (2022)

Keyphrases

maximum number
edit distance
string matching
bayesian networks
digital libraries
finite alphabet
computer vision
knowledge base
data streams
probabilistic model
variable length
finite automata
approximate string matching