ライフサイエンスコーパス: query sequence

1 in the genome likely to be homologous to the query sequence.

2 coding region corresponds to a region in the query sequence.

3 e phenotype and its relative severity from a query sequence.

4 se for proteins with distant similarity to a query sequence.

5 h sequence is perfectly complementary to the query sequence.

6 s of known function or structure for a given query sequence.

7 gnments according to their similarity to the query sequence.

8 the construction of local alignments to the query sequence.

9 hese features aid in the classification of a query sequence.

10 ses for sequences that are most similar to a query sequence.

11 also reports the coordinates of exons in the query sequence.

12 ing rat gamma-glutamyl hydrolase cDNA as the query sequence.

13 ions that constitute the 3D structure of the query sequence.

14 contain the glycan sequence identical to the query sequence.

15 lice variants or close homologs for an input query sequence.

16 ng likelihood of each matched residue in the query sequence.

17 can predict the binding site residues in the query sequence.

18 ed a criterion for selecting templates for a query sequence.

19 arious patterns to identify target hits to a query sequence.

20 quence similarity of the database hit to the query sequence.

21 y history of the subfamily associated with a query sequence.

22 rching a sequence database with an arbitrary query sequence.

23 of the secondary-structure prediction of the query sequence.

24 ly 20-30 base) sequences that will bind to a query sequence.

25 onary or functional relationships to a given query sequence.

26 ctive and reproducible way based on an input query sequence.

27 s that share significant similarity with the query sequences.

28 curacy is poor when used with partial-length query sequences.

29 clones that are identical or similar to the query sequences.

30 alignment and the phylogenetic positions of query sequences.

31 teraction residues from solved structures to query sequences.

32 pplication of these matrices for analysis of query sequences.

33 nder, an online resource to identify ESEs in query sequences.

34 nments based on multiple database matches to query sequences.

35 s that are most appropriate for modeling the query sequences.

36 By using as the query sequence a previously identified plastidial FMN hy

37 Using a 375 residue query sequence a speed of 136 billion cell updates per s

38 the general algorithm they use to compare a query sequence against a database of sequences.

39 nment tool, to compute local alignments of a query sequence against a fixed multiple-genome alignment

40 These websites allow the user to search a query sequence against a library of covariance models, a

41 ugment the previously available mode using a query sequence against an STS database.

42 i.e., comparing the MS/MS-determined protein query sequence against the six-frame translations of the

43 applications is to match a set of nucleotide query sequences against a large sequence dataset.

44 ed search facilities to return alignments of query sequences against multiple sequence alignments; th

45 in all recently revealed families) from the query sequence along with known or predicted canonical b

46 ools for efficient homology search between a query sequence and a database of multiple alignments.

47 Candidates for bona fide matches between a query sequence and a genome assembly are listed at the t

48 ships) assesses the relationship between the query sequence and a hit in the database by considering

49 to infer functional relationships between a query sequence and a template structure, and is particul

50 This allows both individual query sequence and bulk data submission, permitting easy

51 mall matching parts, called seeds, between a query sequence and database sequences.

52 ignment tool for detecting matches between a query sequence and entries in nucleotide sequence databa

53 ses BLAST to detect proteins homologous to a query sequence and identifies the reference proteins amo

54 -intensive work of locating the exons of the query sequence and improves the process of defining intr

55 ond tool, BSS (Blast Some Sequence), takes a query sequence and positions it on the map based on sequ

56 It can be computed directly from the query sequence and potential of interactions, eliminatin

57 ich tends to anchor the PSSM to the original query sequence and slightly increase target percent iden

58 ep, FASTA-SWAP searches the diagonals of the query sequence and the library pattern for high-scoring

59 in target sequences that are similar to the query sequence and the noise is the count over all targe

60 o account both length and composition of the query sequence and the number of decoys in threading sim

61 ash table the "hits" for each k-tuple in the query sequence and then performing a sort on the results

62 calculates true sequence similarity between query sequences and database hits using pairwise sequenc

63 efficiently detecting similarity between the query sequences and database sequences.

64 Alternatively, by using query sequences and EST libraries from the same species

65 RRSs in the AAV ITRs and AAVS1 separately as query sequences and identified 18 new RRSs in or flankin

66 omains of proteins of known structure as the query sequences and the program PSI-BLAST.

67 STN searches by multiplexing (concatenating) query sequences and thereby reducing the number of actua

68 ancestors of multiple database hits for each query sequence, and further classification reliabilities

69 , and backbone torsion angles for the entire query sequence are then predicted by piecing together mu

70 Query sequences are first matched against the pre-calcul

71 These query sequences are used to search the GenBank and expre

72 n a likelihood value for each residue of the query sequence as belonging to a domain boundary.

73 We identify the nearest neighbors of a query sequence by partitioning the query into windows an

74 biguous recognition of a reference base in a query sequence by testing the query for substrings from

75 s, SVM-HUSTLE builds an SVM classifier for a query sequence by training on a collection of representa

76 ome sequences, the approximate location of a query sequence can be predicted in cattle, pig, mouse an

77 Query sequences can be submitted to the homology recogni

78 l, FASTX and FASTY perform equivalently when query sequences contain 0-10% errors.

79 llection of tools to manipulate, analyze and query sequencing datasets in a scalable and simple manne

80 osition-specific substitution matrix for the query sequence during the search.

81 Prosite, TMHMM, and pSORT), and by examining queried sequences for amino acid motifs known to serve c

82 onstraints data can also be submitted with a query sequence for RosettaNMR de novo structure determin

83 ing with an evolutionary tree, 20-50 protein query sequences for a gene family are selected from diff

84 y of the identifications can be increased if query sequences for which little information is availabl

85 Using query sequences from known mammalian glutathione transfe

86 For complete-length protein query sequences from large families, PSW's accuracy is s

87 racters that are responsible for classifying query sequences from other genomes into specific ortholo

88 Using query sequences from the glutathione transferase superfa

89 undant sequences and optimized to facilitate query sequence identification by similarity.

90 to matched residues between the template and query sequence in local alignments using a set of select

91 Searching for a query sequence in the database is done by obtaining from

92 ted features are superimposed on the aligned query sequence in the output, thus greatly increasing th

93 ication of motif patterns, membership of the query sequences in family databases, metabolic pathway i

94 protein data bank using CDT polypeptides as query sequences indicated that CdtB bears significant po

95 speeds up homology search by preprocessing a query sequence into a lookup table.

96 isualized in further detail by embedding the query sequence into multiple alignment displays and by m

97 uences of any length because it divides long query sequences into overlapping fragments and then merg

98 Each position of the query sequence is aligned with the database amino acids

99 The query sequence is also presented aligned with a select g

100 The query sequence is broken into segments for comparison to

101 The query sequence is scanned for segments 7 to 19 residues

102 plates in protein comparative modelling, the query sequence is split into domains.

103 abase hit to the taxonomic assignment of the query sequence is weighted by a Bayesian posterior proba

104 ast one putative homologous template for the query sequences is found.

105 After users input query sequences, it searches gRNA by 3' protospacer-adja

106 They can scale over orders of magnitude in query sequence length.

107 nce database is required for aligning to the query sequences, making our method easily applicable for

108 and multiple alignments when a region of the query sequence matches multiple database sequences.

109 ting the likelihood of a residue pair in the query sequence matching against a corresponding residue

110 Protein query sequences may be compared against databases of pos

111 me databases using known human pre-miRNAs as query sequences, more than 300 genes encoding 142 Xenopu

112 predict functionally important residues in a query sequence of unknown function.

113 Long insertions in query sequences often erroneously result in two copies o

114 web server that allows the user to submit a query sequence or multiple sequence alignment and perfor

115 ative superfamily or fold group to which the query sequence or structure is assigned.

116 Starting from a query sequence or structure, the server automatically co

117 web server enables users to submit either a query sequence or structure.

118 nal classification, predictive algorithm for query sequences, primary sequence analysis and lists of

119 rts LPI scores for match partners as well as query sequences, providing the opportunity to explore wh

120 This sometimes results in the initial query sequence (Q) being related to a final match (M) in

121 When the original query sequence residues are inserted into gapped positio

122 plasms"; (2) 'using a neuropeptide precursor query sequence, return only HSPs where the target genomi

123 systems from other Gram-negative bacteria as query sequences revealed that R. l. bv. viciae 3841 has

124 -profile alignment methods, that match input query sequence(s) to structural templates by integrating

125 re prediction procedure starts by matching a query sequence segment of nine consecutive amino acid re

126 be the native state structure adopted by the query sequence segment.

127 tation of the frequency of occurrence of all query sequence sub-words within a database.

128 dentification of candidate insulators in the query sequences submitted by users.

129 Protein query sequences submitted to NCBI's protein BLAST search

130 nces show a high degree of similarity to the query sequence, such as assembling shotgun sequences or

131 agment) or entire sequence is matched to the query sequence, such that the fragment results implicitl

132 reference data seems more reliable using ITS query sequences than D1-D2 sequences, especially for the

133 ch program quickly identifies regions of the query sequence that are similar to a database sequence.

134 is plotted, highlighting the portion of the query sequence that is present in the database sequence

135 a powerful annotation tool for large sets of query sequences that are simultaneously compared against

136 Furthermore, when EbEST was challenged with query sequences that harbor more than one gene, it suffe

137 Given an amino acid or nucleotide query sequence the server will return the domain archite

138 For a given query sequence, the method permits one to determine, in

139 From single query sequences, the PRECIS component allows users to ge

140 Starting from a query sequence, ThreaDomEx first threads it through the

141 It works by using BLAST to compare a query sequence to a set of reference sequences for known

142 t hybridization of the fluorescently labeled query sequence to surface-bound oligonucleotide probes.

143 atabase using various B1 subfamily consensus query sequences to determine their integration times int

144 ALignment TOol (SALTO), that aligns protein query sequences to PSSMs using rules for placing and sco

145 determines the evolutionary relationship of query sequences to the database more accurately than do

146 tically depends on the optimal choice of the query sequence used to initiate the search.

147 ies, as well as batch submissions of protein query sequences, utilizing RPS-BLAST to rapidly identify

148 be retrieved by similarity search to a given query sequence via a web interface, by fs-gene cluster b

149 r whenever the subfamily associated with the query sequence was well represented in the multiple alig

150 ength (1.2 kb), 100% of the mutations in the queried sequences were detected with 9-mer arrays.

151 HIV-1 subtyping tool (STAR), such that each query sequence when evaluated against subtype profile al

152 omplementary procedure of comparing a single query sequence with a database of PSI-BLAST-generated PS

153 two sets of programs, one for comparing the query sequence with a protein database and the other for

154 est non-intersecting local alignments of the query sequence with each sequence from a set of proteins

155 e sequence database searches and annotates a query sequence with Gene Ontology terms.

156 Pairwise alignments of the query sequence with protein and cDNA database sequences

157 electing the correct templates, aligning the query sequence with them and building the non-conserved

158 The tool compares query sequences with its databases of domain sequences a

159 libraries, which are used for annotation of query sequences with protein families and domains, has b

160 The server produces alignments of the query sequences with sequences of known structure, and i

161 sers to explore the classification, to place query sequences within the classification, and to downlo