论文部分内容阅读
Deterministic tree-based algorithms are mostly used to guarantee that all the tags in the reader field are successfully identified, and to achieve the best performance. Through an analysis of the deficiencies of existing tree-based algorithms, a Q-ary