![](images/graphics/blank.gif)
Linear-time computation of minimal absent words using suffix array
11
lượt xem 1
download
lượt xem 1
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their computation also provides a fast alternative for measuring approximation in sequence comparison.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD