コーパス検索結果 (left1)
通し番号をクリックするとPubMedの該当ページを表示します
1 PSSM-based kernel logistic regression achieves the accur
2 PSSMs can capture information about conserved patterns w
4 ing the unique expertise of the author of 3D-PSSM for distribution to users, an improvement in recall
11 y build a position specific scoring model (a PSSM or HMM) that captures the pattern of sequence conse
13 -RNA interface residue predictors that use a PSSM-based encoding of sequence windows outperform class
14 an HMM (Hidden Markov Model) and accordingly PSSM-PSSM or HMM-HMM comparison is used for homolog dete
16 sed by combining ensemble learning model and PSSM-RT to better handle the imbalance between binding a
17 many more homologs than single searches, but PSSMs can be contaminated when homologous alignments are
19 tance of the pair-relationships extracted by PSSM-RT and the results validates the usefulness of PSSM
23 OP40 (8353 proteins) for homology detection, PSSM-PSSM and HMM-HMM succeed on 48% and 52% of proteins
24 PDNA-62 and PDNA-224 are used to evaluate PSSM-RT and two existing PSSM encoding methods by five-f
25 re used to evaluate PSSM-RT and two existing PSSM encoding methods by five-fold cross-validation.
27 Pred, which utilizes features extracted from PSSM and residue specific contact-energy to help train a
30 am position-specific scoring matrix (Bi-gram PSSM) are employed to extract protein sequence features,
32 ysis demonstrated an elevated GS activity in PSSM horses, and haplotype analysis and allele age estim
34 rch program derives the column scores of its PSSMs with the aid of pseudocounts, added to the observe
35 based on Position-Specific Scoring Matrices (PSSM) and contact maps to generate detailed and accurate
36 scores, Position Specific Scoring Matrices (PSSM) and physicochemical properties, and developed a ma
41 PSI-BLAST position-specific score matrices (PSSMs) find many more homologs than single searches, but
42 ches using position-specific score matrices (PSSMs) or profiles as queries are more effective at iden
47 basis of position-specific scoring matrices [PSSM]) can be interpreted as revealing a propensity to u
49 ed to as the Position Specific Score Matrix (PSSM) Relation Transformation (PSSM-RT), to encode resid
50 tive profile position specific score matrix (PSSM)-based search strategy, is more sensitive than BLAS
51 ented as a position-specific scoring matrix (PSSM) based on results from oriented peptide library and
53 onstruct a position-specific scoring matrix (PSSM) for zDHHC17 AR binding, with which we predicted an
54 uch as the position-specific scoring matrix (PSSM) impose biologically unrealistic assumptions such a
55 form of a Position-Specific Scoring Matrix (PSSM) is a widely used and highly informative representa
57 nts of the position specific scoring matrix (PSSM) of proteins, the amino-acid sequence, and a matrix
58 g from the position-specific scoring matrix (PSSM) of proteins, those derived from the amino-acid seq
59 ented as a position-specific scoring matrix (PSSM) or an HMM (Hidden Markov Model) and accordingly PS
60 called the position-specific scoring matrix (PSSM) profile, alone and the accuracies of such methods
62 s, such as position specific scoring matrix (PSSM), the amino-acid sequence, and secondary structural
63 that use a position-specific scoring matrix (PSSM)-based representation (PSSMSeq) outperform those th
66 pairwise alignments between the query model (PSSM, HMM) and the subject sequences in the library.
68 We meticulously assess the performance of PSSM-Sumo through a tenfold cross-validation approach, e
69 ine web server that can generate 21 types of PSSM-based feature descriptors, thereby addressing a cru
70 ysical features outperforms exclusive use of PSSM-based evolutionary features in predicting activatio
72 te the use of IMPALA to search a database of PSSMs for protein folds, and one for protein domains inv
73 bly faster when run with a large database of PSSMs than is BLAST or PSI-BLAST when run against the co
75 l results demonstrate that solely relying on PSSM input, the proposed method not only surpasses the o
77 MRFalign outperforms several popular HMM or PSSM-based methods in terms of both alignment accuracy a
79 ion factors, this representation outperforms PSSMs on between 65 and 89 of the 95 transcription facto
82 atly improved performance over the prevalent PSSM-based method for the detection of eukaryotic motifs
83 mination of alignment errors during psiblast PSSM contamination suggested a simple strategy for drama
85 od for low-similarity datasets using reduced PSSM and position-based secondary structural features.
87 the aligned subject sequence, the resulting PSSM rarely produces alignment over-extensions or alignm
88 iding window PSSM-PSSM comparison and scores PSSM similarity using a randomisation-based probabilisti
90 the reduced alphabets with size 13 simplify PSSM structures efficiently while reserving its maximal
91 y based representation (IDSeq) or a smoothed PSSM (SmoPSSMSeq); (ii) Structure-based classifiers that
92 tructure-based classifiers that use smoothed PSSM representation (SmoPSSMStr) outperform those that u
96 This simple step, which tends to anchor the PSSM to the original query sequence and slightly increas
101 and the ability to start a search using the PSSM generated from a previous PSI-BLAST search on a dif
102 nd in practice both motifs that fit well the PSSM model, and those that exhibit strong dependencies b
103 s by comparing the retrieval accuracy of the PSSMs constructed using an iterative procedure to that o
104 LTO), that aligns protein query sequences to PSSMs using rules for placing and scoring gaps that are
105 Score Matrix (PSSM) Relation Transformation (PSSM-RT), to encode residues by utilizing the relationsh
106 ation (SmoPSSMStr) outperform those that use PSSM (PSSMStr) as well as sequence identity based repres
107 Q1 variants as normal or dysfunctional using PSSM-based evolutionary and/or biophysical descriptors.
108 if-binding determinants using sliding window PSSM-PSSM comparison and scores PSSM similarity using a