Sciweavers

362 search results - page 29 / 73
» Finding Motifs with Gaps
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ESWS
2007
Springer
14 years 2 months ago
Combining RDF Vocabularies for Expert Finding
Abstract. This paper presents a framework for the reuse and extension of existing, established vocabularies in the Semantic Web. Driven by the primary application of expert findin...
Boanerges Aleman-Meza, Uldis Bojars, Harold Boley,...
RECOMB
2004
Springer
14 years 9 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
BMCBI
2010
121views more  BMCBI 2010»
13 years 6 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
DEXAW
2003
IEEE
113views Database» more  DEXAW 2003»
14 years 1 months ago
Using Repertory Grids to Test Data Quality and Experts' Hunches
The ‘theorise-inquire’ technique is described, which supports the testing of both experts’ hunches and the quality of data sources. This technique is useful for the identifi...
Simone Stumpf, Janet McDonnell