Space Efficient Data Structures for N-gram Retrieval
A significant problem in computer science is the management of large data strings and a great number of works dealing with the specific problem has been published in the scientific literature. In this article, we use a technique to store efficiently biological sequences, making use of data structure...
Main Authors: | Fotios Kounelis, Christos Makris |
---|---|
Format: | Article |
Language: | English |
Published: |
American Institute of Mathematical Sciences
2017-10-01
|
Series: | AIMS Medical Science |
Subjects: | |
Online Access: | http://www.aimspress.com/medicalScience/article/1663/fulltext.html |
Similar Items
-
Data structures of genome and protein sequences indexing
by: Adeleh asadi
Published: (2016-03-01) -
Practical Compressed Suffix Trees
by: Gonzalo Navarro, et al.
Published: (2013-05-01) -
Approximate String Matching with Compressed Indexes
by: Pedro Morales, et al.
Published: (2009-09-01) -
Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes
by: Bhavsar, Rajul D
Published: (2013) -
Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes
by: Ruby L. V. Moritz, et al.
Published: (2014-03-01)