ライフサイエンスコーパス: exhaustive search

1 icantly lower number of steps as compared to exhaustive search.

2 l, we can avoid this shortcoming by doing an exhaustive search.

3 es are examined three at one time through an exhaustive search.

4 gorithm is substantially more efficient than exhaustive search.

5 procedure that makes it possible to avoid an exhaustive search.

6 ns with no marginal effects if we perform an exhaustive search.

7 e-IGain, which is like MBS-IGain but does an exhaustive search.

8 FastRuns, which trades faster run times for exhaustive searches.

9 We report an Exhaustive Search algorithm for Symmetric Oligomer (ExSS

10 Using an exhaustive search algorithm, we also uncovered thousands

11 By exhaustive search analysis, two photoreaction time const

12 ffective search engine utilized model-driven exhaustive search and a form of binary logic pruning bas

13 Using an exhaustive search and a nonparametric test for mosaic st

14 marker sets into disjoint pieces, where more exhaustive searches can replace the greedy algorithm for

15 re are few tools available for performing an exhaustive search for all tandem repeats in a given sequ

16 The representative set is derived by an exhaustive search for close similarities in the sequence

17 tified origins prevented a comprehensive and exhaustive search for conserved genomic features that we

18 In this paper, we describe an exhaustive search for cyclin genes in the Arabidopsis ge

19 An exhaustive search for homopolymeric tracts (HPTs) identi

20 First, we conducted an exhaustive search for human DNA transposons nested withi

21 This study aimed to conduct an exhaustive search for pathogenic DNA in lymphoproliferat

22 gous mammalian proteins were subjected to an exhaustive search for residues that are critical to thei

23 ed to contain over 10(60) structures, making exhaustive searches for structures of interest impractic

24 The most exhaustive searches have taken place in E. coli, resulti

25 Though an exhaustive search is impossible and the field is changin

26 An exhaustive search is used to identify the optimal compli

27 These exhaustive searches lead to smaller tagSNP sets being ge

28 Despite exhaustive searches, no direct murine orthologue of SHOX

29 y gene and its nearest neighbors requires an exhaustive search of all gene calls associated with the

30 BCP performs a near exhaustive search of all possible change points between

31 Performing an exhaustive search of all possible dates in the span 1250

32 m has three major features: First, it allows exhaustive search of all possible haplotype configuratio

33 algorithm achieved >99.8% agreement with the exhaustive search of LA values, while reduced run time b

34 The unique answer was found after an exhaustive search of more than 1 million (2(20)) possibi

35 ers of the S1' pocket was generated using an exhaustive search of rotamer combinations on a template

36 sposons comprise 17% of the human genome, an exhaustive search of the December 2001 "freeze" of the h

37 An exhaustive search of two-node models, in which each node

38 Exhaustive searches of a mouse genome database identifie

39 We compare our algorithms to an exhaustive search on a small synthetic dataset and our r

40 An exhaustive search over actions is avoided and the proble

41 the resulting solution is established by an exhaustive search over all models compatible with the ex

42 due to the large search space that makes the exhaustive search over all possible component configurat

43 An exhaustive search over model space does not address the

44 ers will be limited by current technology to exhaustive searches over only 15 to 20 bits, searches ov

45 work of Howie et al., but using our modified exhaustive search procedure.

46 An exhaustive search reveals that the simplest set of recep

47 After an exhaustive search, starting from two different random co

48 We performed an exhaustive search that identified articles exploring the

49 e classification algorithms were involved in exhaustive search that led to their low time-efficiencie

50 from genome-wide association studies rely on exhaustive search through all possible causal configurat

51 In contrast to the exhaustive search, whose computational complexity is com

52 previous methods have been unable to combine exhaustive search with complex motif representations and

53 demonstrated a much faster running time over exhaustive search with the same accuracy.

54 An exhaustive search yielded no evidence for the phenyl + e