Molecular biologists frequently compare an unknown protein sequence with a set of other known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithms exist for the problem, the required scanning time is still very high, and because of the rapid database growth finding fast solutions is of highest importance to research in this area. In this paper we present a new approach to biosequence database scanning on reconfigurable hardware platforms to gain high performance at low cost. To derive an efficient mapping onto this type of architecture, we have designed fine-grained parallel processing elements (PEs). Since our solution is based on reconfigurable hardware, we can design PEs that...
This paper presents the design and implementation of the FPGA-based web server for biological sequen...
Biosequence similarity search is an important application in modern molecular biology. Search algori...
Abstract. An enhanced version of an existing motif search algorithm BMA is presented. Motif searchin...
Protein sequences with unknown functionality are often compared to a set of known sequences to detec...
Bioinformatics is one of the emerging trends in today’s world. The major part of bioinformatics is d...
Searching on DNA and protein databases using sequence comparison algorithms has become one of the mo...
In the world of expanding constellation of biological species for various technological and biologic...
Abstract — Comparing genetic sequences is a well-known prob-lem in bioinformatics. Newly determined ...
An ongoing issue in mass spectrometry is the time it takes to search DNA sequences with MS/MS peptid...
The enormous growth of biological sequence databases has caused bioinformatics to be rapidly moving ...
Thesis (Ph.D.)--Boston UniversityWith advances in biotechnology and computing power, biological data...
Research for new technologies and methods in computational bioinformatics has resulted in many folds...
International audienceGenome sequencing of numerous species raises the need of complete genome compa...
ticular biological sequences. However, the requirements to process the biological data performance. ...
Summarization: DNA sequence comparison is a computationally intensive problem, known widely since th...
This paper presents the design and implementation of the FPGA-based web server for biological sequen...
Biosequence similarity search is an important application in modern molecular biology. Search algori...
Abstract. An enhanced version of an existing motif search algorithm BMA is presented. Motif searchin...
Protein sequences with unknown functionality are often compared to a set of known sequences to detec...
Bioinformatics is one of the emerging trends in today’s world. The major part of bioinformatics is d...
Searching on DNA and protein databases using sequence comparison algorithms has become one of the mo...
In the world of expanding constellation of biological species for various technological and biologic...
Abstract — Comparing genetic sequences is a well-known prob-lem in bioinformatics. Newly determined ...
An ongoing issue in mass spectrometry is the time it takes to search DNA sequences with MS/MS peptid...
The enormous growth of biological sequence databases has caused bioinformatics to be rapidly moving ...
Thesis (Ph.D.)--Boston UniversityWith advances in biotechnology and computing power, biological data...
Research for new technologies and methods in computational bioinformatics has resulted in many folds...
International audienceGenome sequencing of numerous species raises the need of complete genome compa...
ticular biological sequences. However, the requirements to process the biological data performance. ...
Summarization: DNA sequence comparison is a computationally intensive problem, known widely since th...
This paper presents the design and implementation of the FPGA-based web server for biological sequen...
Biosequence similarity search is an important application in modern molecular biology. Search algori...
Abstract. An enhanced version of an existing motif search algorithm BMA is presented. Motif searchin...