131 search results - page 8 / 27 » Computational complexity of isothermic DNA sequencing by hyb... |
106
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
127
click to vote
NAR
2011
14 years 2 months ago
2011
The Universal PBM Resource for OligonucleotideBinding Evaluation (UniPROBE) database is a centralized repository of information on the DNAbinding preferences of proteins as determ...
BMCBI
2008
14 years 11 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
ARC
2007
Springer
15 years 3 months ago
2007
Springer
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...