Add to ORKGAbstract:- Comparing two sequences by using dynamic programming algorithms is studied. Both serial and (multiple processor) parallel computer algorithms are discussed. Numerical performance of the developed software is validated through small to large-scale applications. Results (based upon comparing 2 large sequences with 40,000 and 36,000 character length, respectively, and using 2-24 parallel processors) indicate that the developed software is reliable and highly efficient
The dynamic evaluation of parallelizing compilers and the programs to which they are applied is a fi...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
In the last years the fast growth of bioinformatics field has atracted the attention of computer sci...
Needleman-Wunsch dynamic programming algorithm measures the similarity of the pairwise sequence and ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequ...
AbstractTwo-dimensional arrays can be compared by a generalization of dynamic programming algorithms...
Both in mathematics and in computer science Dynamic Programming is a well known concept. It is an al...
Abstract — Comparing genetic sequences is a well-known prob-lem in bioinformatics. Newly determined ...
Motivation: This paper presents LASSAP, a new software package for sequence comparison. LASSAP is a ...
This research is an experimental study of performance of two multicomputer platforms used in paralle...
Sequence comparison algorithms are sophisticated pieces of software that compare and match identical...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
The dynamic evaluation of parallelizing compilers and the programs to which they are applied is a fi...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
In the last years the fast growth of bioinformatics field has atracted the attention of computer sci...
Needleman-Wunsch dynamic programming algorithm measures the similarity of the pairwise sequence and ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
Optimal multiple sequence alignment by dynamic programming, like many highly dimensional scientific ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequ...
AbstractTwo-dimensional arrays can be compared by a generalization of dynamic programming algorithms...
Both in mathematics and in computer science Dynamic Programming is a well known concept. It is an al...
Abstract — Comparing genetic sequences is a well-known prob-lem in bioinformatics. Newly determined ...
Motivation: This paper presents LASSAP, a new software package for sequence comparison. LASSAP is a ...
This research is an experimental study of performance of two multicomputer platforms used in paralle...
Sequence comparison algorithms are sophisticated pieces of software that compare and match identical...
This thesis deals with sequence alignment algorithms. The sequence alignment is a mutual arrange of ...
The dynamic evaluation of parallelizing compilers and the programs to which they are applied is a fi...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
In the last years the fast growth of bioinformatics field has atracted the attention of computer sci...