A Practical and Scalable Tool to Find Overlaps between Sequences
The evolution of the next generation sequencing technology increases the demand for efficient solutions, in terms of space and time, for several bioinformatics problems. This paper presents a practical and easy-to-implement solution for one of these problems, namely, the all-pairs suffix-prefix prob...
Main Authors: | Maan Haj Rachid, Qutaibah Malluhi |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | BioMed Research International |
Online Access: | http://dx.doi.org/10.1155/2015/905261 |
Similar Items
-
Two Efficient Techniques to Find Approximate Overlaps between Sequences
by: Maan Haj Rachid
Published: (2017-01-01) -
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
by: Maan Haj Rachid, et al.
Published: (2014-01-01) -
Private Function Evaluation Using Intel’s SGX
by: Omar Abou Selo, et al.
Published: (2020-01-01) -
Data Consistency in Multi-Cloud Storage Systems With Passive Servers and Non-Communicating Clients
by: Naram Mhaisen, et al.
Published: (2020-01-01) -
Parallelizing SLPA for Scalable Overlapping Community Detection
by: Konstantin Kuzmin, et al.
Published: (2015-01-01)