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

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

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

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

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

5 gorithm is substantially more efficient than exhaustive search.

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

7 which would take years of computations using exhaustive search.

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

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

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

11 Using an exhaustive search algorithm, we also uncovered thousands

12 By exhaustive search analysis, two photoreaction time const

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

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

15 We execute the algorithm with both an exhaustive search and closed-loop optimization of the va

16 acteristics (AUROC) curves were used with an exhaustive search approach to find a discriminant set of

17 rently in use, such as greedy algorithms and exhaustive search are unsuitable for MU-MIMO systems.

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

19 tially with the number of species, and so an exhaustive search cannot be performed even for a dozen s

20 the HEDGES (Hash Encoded, Decoded by Greedy Exhaustive Search) error-correcting code that repairs al

21 records, comparing GBCSS with a traditional exhaustive search (ES) algorithm, a state-of-the-art lea

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

23 We augment TreeMix with an exhaustive search for an MLNO, referring to this approac

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

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

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

27 An exhaustive search for homopolymeric tracts (HPTs) identi

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

29 We performed an exhaustive search for pairwise interaction between genet

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

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

32 We conducted an exhaustive search for three-dimensional structural homol

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

34 h-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplificatio

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

36 roposed genetic algorithm is superior to the exhaustive search in terms of computational time for ide

37 ng a globally optimal Bayesian Network using exhaustive search is a problem with super-exponential co

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

39 An exhaustive search is used to identify the optimal compli

40 These exhaustive searches lead to smaller tagSNP sets being ge

41 computation, we offer a rapid, reliable, and exhaustive search mechanism to enumerate a comprehensive

42 Despite exhaustive searches, no direct murine orthologue of SHOX

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

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

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

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

47 specialized tool, optimized for a rapid and exhaustive search of any antibody region against all kno

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

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

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

51 selectivity of 15 ribozymes derived from an exhaustive search of sequence space.

52 an attempt to reach a consensus, we made an exhaustive search of the available literature and compil

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

54 ll networks, this can be achieved through an exhaustive search of the network topology space.

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

56 Exhaustive searches of a mouse genome database identifie

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

58 An exhaustive search over actions is avoided and the proble

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

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

61 An exhaustive search over model space does not address the

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

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

64 fying these combinations through traditional exhaustive search requires the amount of computation tha

65 iers for 16 cancer types perform on par with exhaustive search results, and score the average of 80.1

66 An exhaustive search reveals that the simplest set of recep

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

68 ssive neural representation and combining an exhaustive search strategy with gradient-based optimizat

69 We performed an exhaustive search that identified articles exploring the

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

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

72 ssociation study (GWAS) results, we used the exhaustive search to find the top SNPs or SNP sets that

73 o rely on time-consuming and computationally exhaustive searches to recognise characteristic features

74 After an exhaustive search, we identified 16 relevant risk scores

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

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

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

78 n 16 days (compared with over 500 days using exhaustive search without early prediction), and subsequ

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