Now showing items 1-5 of 5
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 ...
Assessing the effects of data selection and representation on the development of reliable E. coli sigma 70 promoter region predictors
( Public Library of Science , 2015 , Article)
As the number of sequenced bacterial genomes increases, the need for rapid and reliable tools for the annotation of functional elements (e.g., transcriptional regulatory elements) becomes more desirable. Promoters are the ...
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 ...
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 ...
Skyline Discovery and Composition of Multi-Cloud Mashup Services
( Institute of Electrical and Electronics Engineers , 2016 , Article)
A cloud mashup is composed of multiple services with shared datasets and integrated functionalities. For example, the elastic compute cloud (EC2) provided by Amazon Web Service (AWS), the authentication and authorization ...