戻る
「早戻しボタン」を押すと検索画面に戻ります。 [閉じる]

コーパス検索結果 (１語後でソート)

通し番号をクリックするとPubMedの該当ページを表示します
1 quence similarity of the database hit to the query sequence.
2 in the genome likely to be homologous to the query sequence.
3 coding region corresponds to a region in the 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 also reports the coordinates of exons in the query sequence.
11 e phenotype and its relative severity from a query sequence.
12 ing rat gamma-glutamyl hydrolase cDNA as the query sequence.
13 retrieve similar local haplotypes matching a query sequence.
14 rovide key insights into conservation of the query sequence.
15 ses for sequences that are most similar to a query sequence.
16 ions that constitute the 3D structure of the query sequence.
17 contain the glycan sequence identical to the query sequence.
18 lice variants or close homologs for an input query sequence.
19 an predict the specific toxicity type of the query sequence.
20 ng likelihood of each matched residue in the query sequence.
21 can predict the binding site residues in the query sequence.
22 ed a criterion for selecting templates for a query sequence.
23 arious patterns to identify target hits to a query sequence.
24 y history of the subfamily associated with a query sequence.
25 rching a sequence database with an arbitrary query sequence.
26 of the secondary-structure prediction of the query sequence.
27 ly 20-30 base) sequences that will bind to a query sequence.
28 onary or functional relationships to a given query sequence.
29 ctive and reproducible way based on an input query sequence.
30 ucleotide queries and larger sets of protein query sequences.
31 nments based on multiple database matches to query sequences.
32 s that share significant similarity with the query sequences.
33 curacy is poor when used with partial-length query sequences.
34  clones that are identical or similar to the query sequences.
35 l Alignment Search Tool) to categorize their query sequences.
36 rate tool for phylogenetic analyses of novel query sequences.
37  alignment and the phylogenetic positions of query sequences.
38 teraction residues from solved structures to query sequences.
39 pplication of these matrices for analysis of query sequences.
40 nder, an online resource to identify ESEs in query sequences.
41 s that are most appropriate for modeling the query sequences.
42                              By using as the query sequence a previously identified plastidial FMN hy
43                          Using a 375 residue query sequence a speed of 136 billion cell updates per s
44                        SHOOT searches a user query sequence against a database of phylogenetic trees
45  the general algorithm they use to compare a query sequence against a database of sequences.
46 nment tool, to compute local alignments of a query sequence against a fixed multiple-genome alignment
47    These websites allow the user to search a query sequence against a library of covariance models, a
48 ugment the previously available mode using a query sequence against an STS database.
49 i.e., comparing the MS/MS-determined protein query sequence against the six-frame translations of the
50 applications is to match a set of nucleotide query sequences against a large sequence dataset.
51 ed search facilities to return alignments of query sequences against multiple sequence alignments; th
52  in all recently revealed families) from the query sequence along with known or predicted canonical b
53 ools for efficient homology search between a query sequence and a database of multiple alignments.
54   Candidates for bona fide matches between a query sequence and a genome assembly are listed at the t
55 ships) assesses the relationship between the query sequence and a hit in the database by considering
56  the user to view an alignment between their query sequence and a representative FunFam structure and
57  to infer functional relationships between a query sequence and a template structure, and is particul
58 arches the phylogenetic neighborhood of each query sequence and attempts to infer microbial taxonomy.
59                  This allows both individual query sequence and bulk data submission, permitting easy
60 mall matching parts, called seeds, between a query sequence and database sequences.
61 ignment tool for detecting matches between a query sequence and entries in nucleotide sequence databa
62 ses BLAST to detect proteins homologous to a query sequence and identifies the reference proteins amo
63 -intensive work of locating the exons of the query sequence and improves the process of defining intr
64 ond tool, BSS (Blast Some Sequence), takes a query sequence and positions it on the map based on sequ
65         It can be computed directly from the query sequence and potential of interactions, eliminatin
66 ich tends to anchor the PSSM to the original query sequence and slightly increase target percent iden
67 ep, FASTA-SWAP searches the diagonals of the query sequence and the library pattern for high-scoring
68  in target sequences that are similar to the query sequence and the noise is the count over all targe
69 o account both length and composition of the query sequence and the number of decoys in threading sim
70 ash table the "hits" for each k-tuple in the query sequence and then performing a sort on the results
71  calculates true sequence similarity between query sequences and database hits using pairwise sequenc
72 efficiently detecting similarity between the query sequences and database sequences.
73                      Alternatively, by using query sequences and EST libraries from the same species
74 RRSs in the AAV ITRs and AAVS1 separately as query sequences and identified 18 new RRSs in or flankin
75 omains of proteins of known structure as the query sequences and the program PSI-BLAST.
76 STN searches by multiplexing (concatenating) query sequences and thereby reducing the number of actua
77 ancestors of multiple database hits for each query sequence, and further classification reliabilities
78 , and backbone torsion angles for the entire query sequence are then predicted by piecing together mu
79                                              Query sequences are first matched against the pre-calcul
80                                        These query sequences are used to search the GenBank and expre
81               Importantly, Hound can use the query sequence as a guide to merge contigs, and reconstr
82 n a likelihood value for each residue of the query sequence as belonging to a domain boundary.
83 ction; in the first phase, it will predict a query sequence as enzyme or non-enzyme; in the second ph
84       We identify the nearest neighbors of a query sequence by partitioning the query into windows an
85 biguous recognition of a reference base in a query sequence by testing the query for substrings from
86 s, SVM-HUSTLE builds an SVM classifier for a query sequence by training on a collection of representa
87 tersection of the results of the search on a query sequence can be obtained.
88 ome sequences, the approximate location of a query sequence can be predicted in cattle, pig, mouse an
89 eraging Cas9's off-target cleavage activity, query sequences cleave both exact and closely related ta
90 l, FASTX and FASTY perform equivalently when query sequences contain 0-10% errors.
91 ylogenetic trees and returns a tree with the query sequence correctly placed within it.
92 llection of tools to manipulate, analyze and query sequencing datasets in a scalable and simple manne
93                                           By querying sequencing-datasets of patients with dystonia a
94 e gene phylogeny can be misleading because a query sequence does not necessarily belong to the same s
95 osition-specific substitution matrix for the query sequence during the search.
96  in [Formula: see text] time, where Q is the query sequence, E is the set of edges, and H is the set
97 proaches use sequence alignment to compare a query sequence either to thousands of models of protein
98 Prosite, TMHMM, and pSORT), and by examining queried sequences for amino acid motifs known to serve c
99 onstraints data can also be submitted with a query sequence for RosettaNMR de novo structure determin
100 ing with an evolutionary tree, 20-50 protein query sequences for a gene family are selected from diff
101 y of the identifications can be increased if query sequences for which little information is availabl
102                                        Using query sequences from known mammalian glutathione transfe
103                  For complete-length protein query sequences from large families, PSW's accuracy is s
104 racters that are responsible for classifying query sequences from other genomes into specific ortholo
105                                        Using query sequences from the glutathione transferase superfa
106 undant sequences and optimized to facilitate query sequence identification by similarity.
107 to matched residues between the template and query sequence in local alignments using a set of select
108                              Searching for a query sequence in the database is done by obtaining from
109 ted features are superimposed on the aligned query sequence in the output, thus greatly increasing th
110 ication of motif patterns, membership of the query sequences in family databases, metabolic pathway i
111 accuracies increased from 0.92 to >0.98 when query sequences increased from 150-350 to >850 bp.
112  protein data bank using CDT polypeptides as query sequences indicated that CdtB bears significant po
113 speeds up homology search by preprocessing a query sequence into a lookup table.
114 isualized in further detail by embedding the query sequence into multiple alignment displays and by m
115  two-step XGBoost models first classify each query sequence into one of three groups: infectious viru
116 uences of any length because it divides long query sequences into overlapping fragments and then merg
117                         Each position of the query sequence is aligned with the database amino acids
118                                          The query sequence is also presented aligned with a select g
119 genotype imputation models, we assume that a query sequence is an imperfect mosaic of reference haplo
120                                          The query sequence is broken into segments for comparison to
121                                          The query sequence is scanned for segments 7 to 19 residues
122 plates in protein comparative modelling, the query sequence is split into domains.
123 abase hit to the taxonomic assignment of the query sequence is weighted by a Bayesian posterior proba
124 ast one putative homologous template for the query sequences is found.
125                            After users input query sequences, it searches gRNA by 3' protospacer-adja
126   They can scale over orders of magnitude in query sequence length.
127         The typical millions of database and query sequences make BLAST computationally challenging b
128 nce database is required for aligning to the query sequences, making our method easily applicable for
129 and multiple alignments when a region of the query sequence matches multiple database sequences.
130 ting the likelihood of a residue pair in the query sequence matching against a corresponding residue
131 me databases using known human pre-miRNAs as query sequences, more than 300 genes encoding 142 Xenopu
132 predict functionally important residues in a query sequence of unknown function.
133                           Long insertions in query sequences often erroneously result in two copies o
134                  Phylogenetic placement of a query sequence on a backbone tree is increasingly used a
135                            After users place query sequences on a reference nifH gene tree provided b
136  web server that allows the user to submit a query sequence or multiple sequence alignment and perfor
137 ative superfamily or fold group to which the query sequence or structure is assigned.
138                              Starting from a query sequence or structure, the server automatically co
139  web server enables users to submit either a query sequence or structure.
140 PIT inferences based on visual inspection of query sequence placement can achieve taxonomic inference
141 nal classification, predictive algorithm for query sequences, primary sequence analysis and lists of
142 rts LPI scores for match partners as well as query sequences, providing the opportunity to explore wh
143        This sometimes results in the initial query sequence (Q) being related to a final match (M) in
144                            When the original query sequence residues are inserted into gapped positio
145 plasms"; (2) 'using a neuropeptide precursor query sequence, return only HSPs where the target genomi
146 systems from other Gram-negative bacteria as query sequences revealed that R. l. bv. viciae 3841 has
147 re prediction procedure starts by matching a query sequence segment of nine consecutive amino acid re
148 be the native state structure adopted by the query sequence segment.
149 tation of the frequency of occurrence of all query sequence sub-words within a database.
150 dentification of candidate insulators in the query sequences submitted by users.
151                                      Protein query sequences submitted to NCBI's protein BLAST search
152 nces show a high degree of similarity to the query sequence, such as assembling shotgun sequences or
153 agment) or entire sequence is matched to the query sequence, such that the fragment results implicitl
154                         Varia_VIP was tested querying sequence tags from all DBL domain types using d
155 reference data seems more reliable using ITS query sequences than D1-D2 sequences, especially for the
156 ch program quickly identifies regions of the query sequence that are similar to a database sequence.
157  is plotted, highlighting the portion of the query sequence that is present in the database sequence
158 a powerful annotation tool for large sets of query sequences that are simultaneously compared against
159  Furthermore, when EbEST was challenged with query sequences that harbor more than one gene, it suffe
160            Given an amino acid or nucleotide query sequence the server will return the domain archite
161                                  For a given query sequence, the method permits one to determine, in
162                                  From single query sequences, the PRECIS component allows users to ge
163                              Starting from a query sequence, ThreaDomEx first threads it through the
164         It works by using BLAST to compare a query sequence to a set of reference sequences for known
165 t hybridization of the fluorescently labeled query sequence to surface-bound oligonucleotide probes.
166 atabase using various B1 subfamily consensus query sequences to determine their integration times int
167  ALignment TOol (SALTO), that aligns protein query sequences to PSSMs using rules for placing and sco
168  determines the evolutionary relationship of query sequences to the database more accurately than do
169  free portal allowing users to compare their query sequences to those observed in the natural reperto
170 tically depends on the optimal choice of the query sequence used to initiate the search.
171 ies, as well as batch submissions of protein query sequences, utilizing RPS-BLAST to rapidly identify
172 be retrieved by similarity search to a given query sequence via a web interface, by fs-gene cluster b
173 r whenever the subfamily associated with the query sequence was well represented in the multiple alig
174 ength (1.2 kb), 100% of the mutations in the queried sequences were detected with 9-mer arrays.
175  HIV-1 subtyping tool (STAR), such that each query sequence when evaluated against subtype profile al
176 omplementary procedure of comparing a single query sequence with a database of PSI-BLAST-generated PS
177  two sets of programs, one for comparing the query sequence with a protein database and the other for
178 est non-intersecting local alignments of the query sequence with each sequence from a set of proteins
179 e sequence database searches and annotates a query sequence with Gene Ontology terms.
180                   Pairwise alignments of the query sequence with protein and cDNA database sequences
181 electing the correct templates, aligning the query sequence with them and building the non-conserved
182                            The tool compares query sequences with its databases of domain sequences a
183  libraries, which are used for annotation of query sequences with protein families and domains, has b
184        The server produces alignments of the query sequences with sequences of known structure, and i
185 benchmarks known to the authors include only query sequences with single protein domains.
186 sers to explore the classification, to place query sequences within the classification, and to downlo

 
Page Top