Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Paper
A Fast Test for Unique Decipherability Based on Suffix Trees
Abstract
The classical algorithm for testing unique decipherability of codes is improved by using McCreight’s algorithm for constructing suffix trees. The complexity of the algorithm is O(nm) where n is the number of codewords and m is their total length. Efficiency is gained by avoiding repeatedly comparing subwords of the codewords. © 1982. IEEE. All rights reserved.
Related
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008