PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Na, Joong Chae"

Author of the publication

copydeleteadd this publication to your clipboard
Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree.

, , , and . JCSE, 3 (1): 1-14 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. Na Liu University of Stuttgart

Michael Navratil University of Stuttgart

Mojtaba Nayyeri University of Stuttgart

Daniel Nagel University of Stuttgart

Mohsen Naghdinasab University of Stuttgart

 

Other publications of authors with the same name

On-line construction of parameterized suffix trees for large alphabets., , and . Inf. Process. Lett., 111 (5): 201-207 (2011)Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree., , , and . JCSE, 3 (1): 1-14 (2009)Faster Filters for Approximate String Matching., and . ALENEX, SIAM, (2007)Data Compression with Truncated Suffix Trees., and . Data Compression Conference, page 565. IEEE Computer Society, (2000)Finding consensus and optimal alignment of circular strings., , , , and . Theor. Comput. Sci., (2013)FM-index of alignment with gaps., , , , , , , and . Theor. Comput. Sci., (2018)On-Line Construction of Parameterized Suffix Trees., , and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 31-38. Springer, (2009)Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 1185-1194. Springer, (2009)Suffix Tree of Alignment: An Efficient Index for Similar Data., , , , , , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 337-348. Springer, (2013)On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time., , and . Algorithmica, 48 (2): 173-186 (2007)