Suffix Tree of Alignment: An Efficient Index for Similar Data-Reference-Cited by-同舟云学术

Suffix Tree of Alignment: An Efficient Index for Similar Data

Published:2013 Issue: Volume: Page:337-348
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Na Joong Chae,Park Heejin,Crochemore Maxime,Holub Jan,Iliopoulos Costas S.,Mouchard Laurent,Park Kunsoo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-45278-9_29

Reference23 articles.

1. The 1000 Genomes Project Consortium. A map of human genome variation from population-scale sequencing 467(7319), 1061–1073 (2010)

2. Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic dictionary matching. J. Comput. Syst. Sci. 49, 208–222 (1994)

3. Baeza-Yates, R.A., Gonnet, G.H.: Fast text searching for regular expressions or automaton searching on tries. J. ACM 43(6), 915–936 (1996)

4. Lecture Notes in Computer Science;P. Bille,2011

5. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, California (1994)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. TRGST: An enhanced generalized suffix tree for topological relations between paths;Information Systems;2024-11

2. Lightweight Pattern Matching Method for DNA Sequencing in Internet of Medical Things;Computational Intelligence and Neuroscience;2022-09-08

3. Algorithms and Complexity on Indexing Founder Graphs;Algorithmica;2022-07-28

4. Grammar-compressed indexes with logarithmic search time;Journal of Computer and System Sciences;2021-06

5. Towards Faster Matching Algorithm Using Ternary Tree in the Area of Genome Mapping;Advances in Intelligent Networking and Collaborative Systems;2020-08-21