Sciweavers

450 search results - page 50 / 90
» Estimating Search Tree Size
Sort
View
BMCBI
2008
87views more  BMCBI 2008»
13 years 9 months ago
Protein structure search and local structure characterization
Background: Structural similarities among proteins can provide valuable insight into their functional mechanisms and relationships. As the number of available three-dimensional (3...
Shih-Yen Ku, Yuh-Jyh Hu
BMCBI
2010
124views more  BMCBI 2010»
13 years 9 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
14 years 2 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
KBSE
2005
IEEE
14 years 2 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret