Sciweavers

4725 search results - page 935 / 945
» Dependence-Based Program Analysis
Sort
View
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BMCBI
2005
130views more  BMCBI 2005»
13 years 7 months ago
Squid - a simple bioinformatics grid
Background: BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled &...
Paulo C. Carvalho, Rafael V. Glória, Antoni...
BMCBI
2005
103views more  BMCBI 2005»
13 years 7 months ago
SeqDoC: rapid SNP and mutation detection by direct comparison of DNA sequence chromatograms
Background: This paper describes SeqDoC, a simple, web-based tool to carry out direct comparison of ABI sequence chromatograms. This allows the rapid identification of single nucl...
Mark L. Crowe
BMCBI
2005
67views more  BMCBI 2005»
13 years 7 months ago
Selecting additional tag SNPs for tolerating missing data in genotyping
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
BMCBI
2005
94views more  BMCBI 2005»
13 years 7 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel