z-logo
open-access-imgOpen Access
An Efficient Suffix Tree Reconstructing Algorithm for Biological Sequence Analysis
Author(s) -
Haechul Choi,
Young-Seok Jung,
Sang-Jin Kim
Publication year - 2014
Publication title -
diji'teol jeongchaeg yeon'gu
Language(s) - English
Resource type - Journals
eISSN - 1975-0722
pISSN - 1738-1916
DOI - 10.14400/jdc.2014.12.12.265
Subject(s) - substring , suffix tree , generalized suffix tree , string searching algorithm , string (physics) , compressed suffix array , suffix , algorithm , sequence (biology) , subsequence , computer science , character (mathematics) , longest common subsequence problem , tree (set theory) , mathematics , data structure , combinatorics , programming language , biology , mathematical analysis , linguistics , philosophy , geometry , bounded function , mathematical physics , genetics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here