Sciweavers

60 search results - page 12 / 12
» DIALIGN-T: An improved algorithm for segment-based multiple ...
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
13 years 5 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
BMCBI
2006
166views more  BMCBI 2006»
13 years 5 months ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...
BMCBI
2002
133views more  BMCBI 2002»
13 years 5 months ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
CF
2007
ACM
13 years 9 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
BMCBI
2008
131views more  BMCBI 2008»
13 years 5 months ago
CoCoNUT: an efficient system for the comparison and analysis of genomes
Background: Comparative genomics is the analysis and comparison of genomes from different species. This area of research is driven by the large number of sequenced genomes and hea...
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohl...