Searching and Indexing Genomic Databases via Kernelization
The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes. Several authors have recently suggested searching or indexing only one re...
Main Authors: | Travis eGagie, Simon ePuglisi |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2015-02-01
|
Series: | Frontiers in Bioengineering and Biotechnology |
Subjects: | |
Online Access: | http://journal.frontiersin.org/Journal/10.3389/fbioe.2015.00012/full |
Similar Items
-
Supporting Uncertain Predicates in DBMS Using Approximate String Matching and Probabilistic Databases
by: Amol S. Jumde, et al.
Published: (2020-01-01) -
Space-Efficient Feature Maps for String Alignment Kernels
by: Yasuo Tabei, et al.
Published: (2020-05-01) -
Approximate String Matching with Compressed Indexes
by: Pedro Morales, et al.
Published: (2009-09-01) -
Improving database quality through eliminating duplicate records
by: Mingzhen Wei, et al.
Published: (2006-11-01) -
Pattern-matching with bounded gaps in genomic sequences
by: Yoan José Pinzon Ardila, et al.
Published: (2009-06-01)