HIGHLIGHTS
- who: Iftikhar Ahmad from the Department of Computer and Information Technology, University of Engineering and Technology, Department of Information Technology, FCIT, King Abdulaziz University, Jeddah, Saudi Arabia have published the research: Fault Tolerant Suffix Trees, in the Journal: (JOURNAL)
- what: The authors develop a resilient version of the Ukkonen`s algorithm for constructing the tree and derive an upper bound on the number of corrupt suffixes. The authors design a fault tolerant suffix tree based on the natural technique of data replication. The authors designed a Fault Tolerant Suffix Tree (FTST) data structure which is . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.