Topics
bioinformaticsMusic genre
We design and analyze implementation aspects of a PVM version of the well known Smith-Waterman algorithm, and then we consider other problems important for bioinformatics, such as finding longest common substring, finding repeated substrings and finding palindromes
Background The identification of all matches of a large set of position weight matrices (PWMs) in lo...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
Abstract Background To infer homology and subsequentl...
We design and analyze implementation aspects of a PVM version of the well known Smith-Waterman algor...
PVM algorithms for some problems in bioinformatics This item was submitted to Loughborough Universit...
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system developm...
Following string matching, two more string analysis problems occur commonly in bioinformatics applic...
Graduation date: 1993As the volume of genetic sequence data increases due to improved sequencing\ud ...
The comparison and alignment of DNA and protein sequences are important tasks in molecular biology a...
Advancements in biological research have enabled researchers to obtain large amounts of data, especi...
The work presented in this dissertation deals with establishing efficient methods for solving some a...
The Smith-Waterman algorithm is a dynamic programming method for determining op-timal local alignmen...
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the grow...
String matching algorithms are the algorithms used to search through different types of text in sear...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Background The identification of all matches of a large set of position weight matrices (PWMs) in lo...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
Abstract Background To infer homology and subsequentl...
We design and analyze implementation aspects of a PVM version of the well known Smith-Waterman algor...
PVM algorithms for some problems in bioinformatics This item was submitted to Loughborough Universit...
Smith-Waterman Algorithm represents a highly robust and efficient parallel computing system developm...
Following string matching, two more string analysis problems occur commonly in bioinformatics applic...
Graduation date: 1993As the volume of genetic sequence data increases due to improved sequencing\ud ...
The comparison and alignment of DNA and protein sequences are important tasks in molecular biology a...
Advancements in biological research have enabled researchers to obtain large amounts of data, especi...
The work presented in this dissertation deals with establishing efficient methods for solving some a...
The Smith-Waterman algorithm is a dynamic programming method for determining op-timal local alignmen...
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the grow...
String matching algorithms are the algorithms used to search through different types of text in sear...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Background The identification of all matches of a large set of position weight matrices (PWMs) in lo...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
Abstract Background To infer homology and subsequentl...
Add to ORKG