بحث بسيط
السجلات المعروضة 1 -- 4 من 4
Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem
(
Hindawi
, 2014 , Article)
The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of ...
The similarity-aware relational intersect database operator
(
Springer International Publishing
, 2014 , Conference Paper)
Identifying similarities in large datasets is an essential operation in many applications such as bioinformatics, pattern recognition, and data integration. To make the underlying database system similarity-aware, the core ...
FastRNABindR: Fast and Accurate Prediction of Protein-RNA Interface Residues
(
Public Library of Science (PLoS)
, 2016 , Article)
A wide range of biological processes, including regulation of gene expression, protein synthesis, and replication and assembly of many viruses are mediated by RNA-protein interactions. However, experimental determination ...
A Practical and Scalable Tool to Find Overlaps between Sequences
(
Hindawi
, 2015 , Article)
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 ...