期刊
THEORETICAL COMPUTER SCIENCE
卷 387, 期 3, 页码 298-312出版社
ELSEVIER
DOI: 10.1016/j.tcs.2007.07.014
关键词
Burrows-Wheeler transform; sequence comparison; alignment-free distance measure
We describe and highlight a generalization of the Burrows-Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A*. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt. (c) 2007 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据