28 search results - page 5 / 6 » Parallel short sequence mapping for high throughput genome s... |
BMCBI
2008
13 years 5 months ago
2008
Background: High throughput signature sequencing holds many promises, one of which is the ready identification of in vivo transcription factor binding sites, histone modifications...
FCCM
2011
IEEE
12 years 9 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
BMCBI
2006
13 years 5 months ago
2006
Background: In the current era of high throughput genomics a major challenge is the genome-wide identification of target genes for specific transcription factors. Chromatin immuno...
BMCBI
2011
12 years 9 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
FPL
2008
Springer
13 years 7 months ago
2008
Springer
Wavefront algorithms, such as the Smith-Waterman algorithm, are commonly used in bioinformatics for exact local and global sequence alignment. These algorithms are highly computat...