Sciweavers

1278 search results - page 16 / 256
» Information Analysis of DNA Sequences
Sort
View
78
Voted
BMCBI
2007
122views more  BMCBI 2007»
14 years 10 months ago
Dissecting complex transcriptional responses using pathway-level scores based on prior information
Background: The genomewide pattern of changes in mRNA expression measured using DNA microarrays is typically a complex superposition of the response of multiple regulatory pathway...
Harmen J. Bussemaker, Lucas D. Ward, André ...
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
15 years 4 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...
CIKM
2009
Springer
15 years 2 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
VLSID
2002
IEEE
106views VLSI» more  VLSID 2002»
15 years 10 months ago
SWASAD: An ASIC Design for High Speed DNA Sequence Matching
This paper presents the Smith and Waterman Algorithm-Specific ASIC Design (SWASAD) project. This is a hardware solution that implements the S&W algorithm.. The SWASAD is an imp...
Tony Han, Sri Parameswaran
MST
2006
104views more  MST 2006»
14 years 10 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker