PAirwise Sequence Comparison (PASC) and its application in the classification of filoviruses.
Ontology highlight
ABSTRACT:
SUBMITTER: Bao Y
PROVIDER: S-EPMC3446765 | biostudies-literature | 2012 Aug
REPOSITORIES: biostudies-literature
Publications
PAirwise Sequence Comparison (PASC) and its application in the classification of filoviruses.
Bao Yiming Y Chetvernin Vyacheslav V Tatusova Tatiana T
Viruses 20120820 8
PAirwise Sequence Comparison (PASC) is a tool that uses genome sequence similarity to help with virus classification. The PASC tool at NCBI uses two methods: local alignment based on BLAST and global alignment based on Needleman-Wunsch algorithm. It works for complete genomes of viruses of several families/groups, and for the family of Filoviridae, it currently includes 52 complete genomes available in GenBank. It has been shown that BLAST-based alignment approach works better for filoviruses, a ...[more]
Similar Datasets
Project description:Pairwise sequence comparison (PASC) is a molecular classification tool for viruses. It calculates the pairwise identities of virus sequences within a virus family and displays their distributions, and can help determine demarcations at different taxonomic levels such as strain, species, genus, and subfamily levels. PASC has many advantages over conventional virus classification methods. The tool has been successfully applied to several virus families, although it may not work well for virus families with highly diverse genome organization. The PASC tool at NCBI established distributions of identity for a number of virus families. A new virus sequence can be tested with this system within a few minutes to suggest the taxonomic position of the virus in a specific family. This system eliminates potential discrepancies in the results caused by different algorithms and/or different data used by the virology community. Data in the system can be updated automatically to reflect changes in virus taxonomy and additions of new virus sequences to the public database. The web interface of the tool makes it easy to navigate and perform analyses.
| S-EPMC7173583 | biostudies-literature
Project description:The number of viral genome sequences in the public databases is increasing dramatically, and these sequences are playing an important role in virus classification. Pairwise sequence comparison is a sequence-based virus classification method. A program using this method calculates the pairwise identities of virus sequences within a virus family and displays their distribution, and visual analysis helps to determine demarcations at different taxonomic levels such as strain, species, genus and subfamily. Subsequent comparison of new sequences against existing ones allows viruses from which the new sequences were derived to be classified. Although this method cannot be used as the only criterion for virus classification in some cases, it is a quantitative method and has many advantages over conventional virus classification methods. It has been applied to several virus families, and there is an increasing interest in using this method for other virus families/groups. The Pairwise Sequence Comparison (PASC) classification tool was created at the National Center for Biotechnology Information. The tool's database stores pairwise identities for complete genomes/segments of 56 virus families/groups. Data in the system are updated every day to reflect changes in virus taxonomy and additions of new virus sequences to the public database. The web interface of the tool ( http://www.ncbi.nlm.nih.gov/sutils/pasc/ ) makes it easy to navigate and perform analyses. Multiple new viral genome sequences can be tested simultaneously with this system to suggest the taxonomic position of virus isolates in a specific family. PASC eliminates potential discrepancies in the results caused by different algorithms and/or different data used by researchers.
| S-EPMC4221606 | biostudies-literature
Project description:Picobirnaviruses (PBVs) are small, double stranded RNA viruses with an ability to infect a myriad of hosts and possessing a high degree of genetic diversity. PBVs are currently classified into two genogroups based upon classification of a 200 nt sequence of RdRp. We demonstrate here that this phylogenetic marker is saturated, affected by homoplasy, and has high phylogenetic noise, resulting in 34% unsolved topologies. By contrast, full-length RdRp sequences provide reliable topologies that allow ancestralism of members to be correctly inferred. MAFFT alignment and maximum likelihood trees were established as the optimal methods to determine phylogenetic relationships, providing complete resolution of PBV RdRp and capsid taxa, each into three monophyletic groupings. Pairwise distance calculations revealed these lineages represent three species. For RdRp, the application of cutoffs determined by theoretical taxonomic distributions indicates that there are five genotypes in species 1, eight genotypes in species 2, and three genotypes in species 3. Capsids were also divided into three species, but sequences did not segregate into statistically supported subdivisions, indicating that diversity is lower than RdRp. We thus propose the adoption of a new nomenclature to indicate the species of each segment (e.g., PBV-C1R2).
| S-EPMC8402817 | biostudies-literature
Project description:The perpetually increasing rate at which viral full-genome sequences are being determined is creating a pressing demand for computational tools that will aid the objective classification of these genome sequences. Taxonomic classification approaches that are based on pairwise genetic identity measures are potentially highly automatable and are progressively gaining favour with the International Committee on Taxonomy of Viruses (ICTV). There are, however, various issues with the calculation of such measures that could potentially undermine the accuracy and consistency with which they can be applied to virus classification. Firstly, pairwise sequence identities computed based on multiple sequence alignments rather than on multiple independent pairwise alignments can lead to the deflation of identity scores with increasing dataset sizes. Also, when gap-characters need to be introduced during sequence alignments to account for insertions and deletions, methodological variations in the way that these characters are introduced and handled during pairwise genetic identity calculations can cause high degrees of inconsistency in the way that different methods classify the same sets of sequences. Here we present Sequence Demarcation Tool (SDT), a free user-friendly computer program that aims to provide a robust and highly reproducible means of objectively using pairwise genetic identity calculations to classify any set of nucleotide or amino acid sequences. SDT can produce publication quality pairwise identity plots and colour-coded distance matrices to further aid the classification of sequences according to ICTV approved taxonomic demarcation criteria. Besides a graphical interface version of the program for Windows computers, command-line versions of the program are available for a variety of different operating systems (including a parallel version for cluster computing platforms).
| S-EPMC4178126 | biostudies-literature
Project description:This study compared the DNA sequences of cytochrome c oxidase subunit I (COI) and histone H3 of Ephemeroptera, Odonata, Plecoptera, and Trichoptera in a pairwise manner, and calculated the sequence similarities based on uncorrected P-distance (number of identical sites in both sequences per total number of the sites compared). Datasets of annotated sequences, the source organisms of which are identified at the species level in taxonomy, were retrieved from INSD (GenBank/ ENA/ DDBJ) as of the end of May 2020. Similarity scores of the pairwise comparison were sorted by the combinations of taxonomic groups; intraspecific variations, intrageneric-interspecific divergences, intrafamily-intergeneric divergences, and intraorder-interfamily divergences for Ephemeroptera, Odonata, Plecoptera, and Trichoptera. Similarity scores at the cumulative relative frequency points (1%, 5%, 10%, and median) may be used as the threshold to differentiate between the taxonomic groups based on sequence match. This is often done in the characterization of morphologically-unidentified specimens using barcode sequences, in the metabarcoding analysis of the local fauna, and environmental DNA analysis.
| S-EPMC7502337 | biostudies-literature
Project description:A structure alignment program aligns two structures by optimizing a scoring function that measures structural similarity. It is highly desirable that such scoring function is independent of the sizes of proteins in comparison so that the significance of alignment across different sizes of the protein regions aligned is comparable. Here, we developed a new score called SP-score that fixes the cutoff distance at 4 Å and removed the size dependence using a normalization prefactor. We further built a program called SPalign that optimizes SP-score for structure alignment. SPalign was applied to recognize proteins within the same structure fold and having the same function of DNA or RNA binding. For fold discrimination, SPalign improves sensitivity over TMalign for the chain-level comparison by 12% and over DALI for the domain-level comparison by 13% at the same specificity of 99.6%. The difference between TMalign and SPalign at the chain level is due to the inability of TMalign to detect single domain similarity between multidomain proteins. For recognizing nucleic acid binding proteins, SPalign consistently improves over TMalign by 12% and DALI by 31% in average value of Mathews correlation coefficients for four datasets. SPalign with default setting is 14% faster than TMalign. SPalign is expected to be useful for function prediction and comparing structures with or without domains defined. The source code for SPalign and the server are available at http://sparks.informatics.iupui.edu.
| S-EPMC3393833 | biostudies-literature
Project description:BackgroundWhile the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor and a similar structure; pairwise sequence alignments often fail to represent accurately the structural alignments inferred from three-dimensional coordinates. Since sequence alignment algorithms produce optimal alignments, the best structural alignments must reflect suboptimal sequence alignment scores. Thus, we have examined a range of suboptimal sequence alignments and a range of scoring parameters to understand better which sequence alignments are likely to be more structurally accurate.ResultsWe compared near-optimal protein sequence alignments produced by the Zuker algorithm and a set of probabilistic alignments produced by the probA program with structural alignments produced by four different structure alignment algorithms. There is significant overlap between the solution spaces of structural alignments and both the near-optimal sequence alignments produced by commonly used scoring parameters for sequences that share significant sequence similarity (E-values < 10-5) and the ensemble of probA alignments. We constructed a logistic regression model incorporating three input variables derived from sets of near-optimal alignments: robustness, edge frequency, and maximum bits-per-position. A ROC analysis shows that this model more accurately classifies amino acid pairs (edges in the alignment path graph) according to the likelihood of appearance in structural alignments than the robustness score alone. We investigated various trimming protocols for removing incorrect edges from the optimal sequence alignment; the most effective protocol is to remove matches from the semi-global optimal alignment that are outside the boundaries of the local alignment, although trimming according to the model-generated probabilities achieves a similar level of improvement. The model can also be used to generate novel alignments by using the probabilities in lieu of a scoring matrix. These alignments are typically better than the optimal sequence alignment, and include novel correct structural edges. We find that the probA alignments sample a larger variety of alignments than the Zuker set, which more frequently results in alignments that are closer to the structural alignments, but that using the probA alignments as input to the regression model does not increase performance.ConclusionsThe pool of suboptimal pairwise protein sequence alignments substantially overlaps structure-based alignments for pairs with statistically significant similarity, and a regression model based on information contained in this alignment pool improves the accuracy of pairwise alignments with respect to structure-based alignments.
| S-EPMC2850363 | biostudies-literature
Project description:Many different types of generative models for protein sequences have been proposed in literature. Their uses include the prediction of mutational effects, protein design and the prediction of structural properties. Neural network (NN) architectures have shown great performances, commonly attributed to the capacity to extract non-trivial higher-order interactions from the data. In this work, we analyze two different NN models and assess how close they are to simple pairwise distributions, which have been used in the past for similar problems. We present an approach for extracting pairwise models from more complex ones using an energy-based modeling framework. We show that for the tested models the extracted pairwise models can replicate the energies of the original models and are also close in performance in tasks like mutational effect prediction. In addition, we show that even simpler, factorized models often come close in performance to the original models.
| S-EPMC9258900 | biostudies-literature
Project description:BackgroundReviewers of dystonia rating scales agree on the need to assess symptoms more comprehensively. During the development of a quantitative dystonia assessment by video-perceptive computing, we devised a video-based severity ranking as a procedure to create a validation standard without the use of clinical scales.MethodsThirty-four patients with dystonia (17 with dystonic tremor) and 2 controls were assessed with clinical scales and video-recordings of 24 short movement tasks. Two to 4 raters compared multiple permutations of videos from 22 subjects, including 2 healthy controls, until a complete rank order was achieved. Inter-rater agreement was expressed as normalized Kendall tau distance. Spearman correlations of video rank order with clinical scales and self-rating were repeated for tremor/nontremor subgroups.ResultsNormalized Kendall tau distances were <0.3 for 15 items. The video rank order for sitting and head movements correlated with clinical scales for the whole group (rho 0.52-0.87) and in the subgroup without tremor. In the tremor subgroup such correlation was perceived in the 2 items involving sitting. Video rank order correlated with quality of life self-rating only in 1 item (arms held in front, palm down).ConclusionsThe agreement of video rankings between raters is remarkable. The lack of correlation in the tremor subgroup in several items may be interpreted as tremor being considered in video comparisons but not in clinical scales. This supports video-based ranking as a more comprehensive rating of dystonia and as a possible validation instrument applicable in situations in which no reference standard is available.
| S-EPMC6178604 | biostudies-literature
Project description:BackgroundConventional pairwise sequence comparison software algorithms are being used to process much larger datasets than they were originally designed for. This can result in processing bottlenecks that limit software capabilities or prevent full use of the available hardware resources. Overcoming the barriers that limit the efficient computational analysis of large biological sequence datasets by retrofitting existing algorithms or by creating new applications represents a major challenge for the bioinformatics community.ResultsWe have developed C libraries for pairwise sequence comparison within diverse architectures, ranging from commodity systems to high performance and cloud computing environments. Exhaustive tests were performed using different datasets of closely- and distantly-related sequences that span from small viral genomes to large mammalian chromosomes. The tests demonstrated that our solution is capable of generating high quality results with a linear-time response and controlled memory consumption, being comparable or faster than the current state-of-the-art methods.ConclusionsWe have addressed the problem of pairwise and all-versus-all comparison of large sequences in general, greatly increasing the limits on input data size. The approach described here is based on a modular out-of-core strategy that uses secondary storage to avoid reaching memory limits during the identification of High-scoring Segment Pairs (HSPs) between the sequences under comparison. Software engineering concepts were applied to avoid intermediate result re-calculation, to minimise the performance impact of input/output (I/O) operations and to modularise the process, thus enhancing application flexibility and extendibility. Our computationally-efficient approach allows tasks such as the massive comparison of complete genomes, evolutionary event detection, the identification of conserved synteny blocks and inter-genome distance calculations to be performed more effectively.
| S-EPMC4531504 | biostudies-literature