Subwords in reverse-complement order
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery（2006）
摘要
We examine nite words over an alphabet Γ = a; fl a; b; fl
更多查看译文
关键词
dna codes,reconstruction of words,levenshtein distance,a classical result for ìnormalî words. this problem has its roots in bioinformatics. keywords: combinatorics of words,05D05,68R15,combinatorics of words,Levenshtein distance,DNA codes
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要