Descriptors of 2D-dynamic graphs as a classification tool of DNA sequences.
Ontology highlight
ABSTRACT:
SUBMITTER: Waz P
PROVIDER: S-EPMC7088265 | biostudies-literature | 2014
REPOSITORIES: biostudies-literature
Publications
Descriptors of 2D-dynamic graphs as a classification tool of DNA sequences.
Wąż Piotr P Bielińska-Wąż Dorota D Nandy Ashesh A
Journal of mathematical chemistry 20130903 1
A new tool of the classification of DNA sequences is introduced. The method is based on 2D-dynamic graphs and their descriptors. Using the descriptors created by centers of masses, moments of inertia, angles between the <i>x</i> axis and the principal axis of inertia of the 2D-dynamic graphs one can obtain classification diagrams in which similar sequences are clustered in separated areas. ...[more]
Similar Datasets
Project description:A new method for the classification of domain movements in proteins is described and applied to 1822 pairs of structures from the Protein Data Bank that represent a domain movement in two-domain proteins. The method is based on changes in contacts between residues from the two domains in moving from one conformation to the other. We argue that there are five types of elemental contact changes and that these relate to five model domain movements called: "free", "open-closed", "anchored", "sliding-twist", and "see-saw." A directed graph is introduced called the "Dynamic Contact Graph" which represents the contact changes in a domain movement. In many cases a graph, or part of a graph, provides a clear visual metaphor for the movement it represents and is a motif that can be easily recognised. The Dynamic Contact Graphs are often comprised of disconnected subgraphs indicating independent regions which may play different roles in the domain movement. The Dynamic Contact Graph for each domain movement is decomposed into elemental Dynamic Contact Graphs, those that represent elemental contact changes, allowing us to count the number of instances of each type of elemental contact change in the domain movement. This naturally leads to sixteen classes into which the 1822 domain movements are classified.
| S-EPMC3832408 | biostudies-literature
Project description:Spatial genomic technologies include imaging- and sequencing-based methods (1-3). An emerging subcategory of sequencing-based methods relies on a surface coated with coordinate-associated DNA barcodes, which are leveraged to tag endogenous nucleic acids or cells in an overlaid tissue section (4-7). However, the physical registration of DNA barcodes to spatial coordinates is challenging, necessitating either high density printing of coordinate-specific oligonucleotides or in situ sequencing/probing of randomly deposited, oligonucleotide-bearing beads. As a consequence, the surface areas available to sequencing-based spatial genomic methods are constrained by the time, labor, cost, and instrumentation required to either print, synthesize or decode a coordinate-tagged surface. To address this challenge, we developed SCOPE (Spatial reConstruction via Oligonucleotide Proximity Encoding), an optics-free, DNA microscopy (8) inspired method. With SCOPE, the relative positions of randomly deposited beads on a 2D surface are inferred from the ex situ sequencing of chimeric molecules formed from diffusing "sender" and tethered "receiver" oligonucleotides. As a first proof-of-concept, we apply SCOPE to reconstruct an asymmetric "swoosh" shape resembling the Nike logo (16.75 × 9.25 mm). Next, we use a microarray printer to encode a "color" version of the Snellen eye chart for visual acuity (17.18 × 40.97 mm), and apply SCOPE to achieve optics-free reconstruction of individual letters. Although these are early demonstrations of the concept and much work remains to be done, we envision that the optics-free, sequencing-based quantitation of the molecular proximities of DNA barcodes will enable spatial genomics in constant experimental time, across fields of view and at resolutions that are determined by sequencing depth, bead size, and diffusion kinetics, rather than the limitations of optical instruments or microarray printers.
| S-EPMC11326233 | biostudies-literature
Project description:Thymomas are malignant thymic epithelial tumors that are difficult to diagnose due to their rarity and complex diagnostic criteria. They represent a morphologically heterogeneous class of tumors mainly defined by “organo-typical” architectural features and cellular composition. The diagnosis of thymoma is burdened with a high inter-observer variability and with the problem that some type-specific morphological alterations are rather a continuum than clear-cut. Methylation pattern-based classification may help to increase diagnostic precision, particularly in borderline cases.
2022-12-16 | GSE218549 | GEO
Project description:MOTIVATION: New generation sequencing technologies producing increasingly complex datasets demand new efficient and specialized sequence analysis algorithms. Often, it is only the 'novel' sequences in a complex dataset that are of interest and the superfluous sequences need to be removed. RESULTS: A novel algorithm, fast and accurate classification of sequences (FACSs), is introduced that can accurately and rapidly classify sequences as belonging or not belonging to a reference sequence. FACS was first optimized and validated using a synthetic metagenome dataset. An experimental metagenome dataset was then used to show that FACS achieves comparable accuracy as BLAT and SSAHA2 but is at least 21 times faster in classifying sequences. AVAILABILITY: Source code for FACS, Bloom filters and MetaSim dataset used is available at http://facs.biotech.kth.se. The Bloom::Faster 1.6 Perl module can be downloaded from CPAN at http://search.cpan.org/ approximately palvaro/Bloom-Faster-1.6/ CONTACTS: henrik.stranneheim@biotech.kth.se; joakiml@biotech.kth.se SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
| S-EPMC2887045 | biostudies-literature
Project description:A new 3D graphical representation of DNA sequences is introduced. This representation is called 3D-dynamic representation. It is a generalization of the 2D-dynamic dynamic representation. The sequences are represented by sets of "material points" in the 3D space. The resulting 3D-dynamic graphs are treated as rigid bodies. The descriptors characterizing the graphs are analogous to the ones used in the classical dynamics. The classification diagrams derived from this representation are presented and discussed. Due to the third dimension, "the history of the graph" can be recognized graphically because the 3D-dynamic graph does not overlap with itself. Specific parts of the graphs correspond to specific parts of the sequence. This feature is essential for graphical comparisons of the sequences. Numerically, both 2D and 3D approaches are of high quality. In particular, a difference in a single base between two sequences can be identified and correctly described (one can identify which base) by both 2D and 3D methods.
| S-EPMC3964303 | biostudies-literature
Project description:One of the main challenges in applying machine learning algorithms to biological sequence data is how to numerically represent a sequence in a numeric input vector. Feature extraction techniques capable of extracting numerical information from biological sequences have been reported in the literature. However, many of these techniques are not available in existing packages, such as mathematical descriptors. This paper presents a new package, MathFeature, which implements mathematical descriptors able to extract relevant numerical information from biological sequences, i.e. DNA, RNA and proteins (prediction of structural features along the primary sequence of amino acids). MathFeature makes available 20 numerical feature extraction descriptors based on approaches found in the literature, e.g. multiple numeric mappings, genomic signal processing, chaos game theory, entropy and complex networks. MathFeature also allows the extraction of alternative features, complementing the existing packages. To ensure that our descriptors are robust and to assess their relevance, experimental results are presented in nine case studies. According to these results, the features extracted by MathFeature showed high performance (0.6350-0.9897, accuracy), both applying only mathematical descriptors, but also hybridization with well-known descriptors in the literature. Finally, through MathFeature, we overcame several studies in eight benchmark datasets, exemplifying the robustness and viability of the proposed package. MathFeature has advanced in the area by bringing descriptors not available in other packages, as well as allowing non-experts to use feature extraction techniques.
| S-EPMC8769707 | biostudies-literature
Project description:Pyrosequencing of 16S ribosomal RNA (rRNA) genes has become the gold standard in human microbiome studies. The routine task of taxonomic classification using 16S rRNA reads is commonly performed by the Ribosomal Database Project (RDP) II Classifier, a robust tool that relies on a set of well-characterized reference sequences. However, the RDP II Classifier may be unable to classify a significant part of the data set due to the absence of proper reference sequences. The taxonomic classification for some unclassified sequences might still be performed using BLAST searches against large and frequently updated nucleotide databases. Here we introduce TUIT (Taxonomic Unit Identification Tool)-an efficient open source and platform-independent application that can perform taxonomic classification on its own or can be used in combination with the RDP II Classifier to maximize the taxonomic identification rate. Using a set of simulated DNA sequences, we demonstrate that the algorithm performs taxonomic classification with high specificity for sequences as short as 125 base pairs. TUIT is applicable for 16S rRNA gene sequence classification; however, it is not restricted to 16S rRNA sequences. In addition, TUIT may be used as a complementary tool for effective taxonomic classification of nucleotide sequences generated by many current platforms, such as Roche 454 and Illumina. Stand-alone TUIT is available online at http://sourceforge.net/projects/tuit/.
| S-EPMC4186660 | biostudies-literature
Project description:Nucleic acids are molecules of choice for both established and emerging nanoscale technologies. These technologies benefit from large functional densities of 'DNA processing elements' that can be readily manufactured. To achieve the desired functionality, polynucleotide sequences are currently designed by a process that involves tedious and laborious filtering of potential candidates against a series of requirements and parameters. Here, we present a complete novel methodology for the rapid rational design of large sets of DNA sequences. This method allows for the direct implementation of very complex and detailed requirements for the generated sequences, thus avoiding 'brute force' filtering. At the same time, these sequences have narrow distributions of melting temperatures. The molecular part of the design process can be done without computer assistance, using an efficient 'human engineering' approach by drawing a single blueprint graph that represents all generated sequences. Moreover, the method eliminates the necessity for extensive thermodynamic calculations. Melting temperature can be calculated only once (or not at all). In addition, the isostability of the sequences is independent of the selection of a particular set of thermodynamic parameters. Applications are presented for DNA sequence designs for microarrays, universal microarray zip sequences and electron transfer experiments.
| S-EPMC516071 | biostudies-literature
Project description:Typical crack detection processes in digital images produce a binary-segmented image that constitutes the basis for all of the following analyses. Binary images are, however, an unsatisfactory data format for advanced crack analysis algorithms due to their sparse nature and lack of significant data structuring. Therefore, this work instead proposes a new approach based on Euclidean graphs as functional crack pattern descriptors for all post-detection analyses. Conveying both geometrical and topological information in an integrated representation, Euclidean graphs are an ideal structure for efficient crack path description, as they precisely locate the cracks on the original image and capture salient crack skeleton features. Several Euclidean graph-based algorithms for autonomous crack refining, correlation and analysis are described, with significant advantages in both their capabilities and implementation convenience over the traditional, binary image-based approach. Moreover, Euclidean graphs allow the autonomous selection of specific cracks or crack parts based on objective criteria. Well-known performance metrics, namely precision, recall, intersection over union and F1-score, have been adapted for use with Euclidean graphs. The automated generation of Euclidean graphs from binary-segmented images is also reported, enabling the application of this technique to most existing detection methods (e.g., threshold-based or neural network-based) for cracks and other curvilinear features in digital images.
| S-EPMC9414651 | biostudies-literature
Project description:Sequence clustering is a fundamental step in analyzing DNA sequences. Widely-used software tools for sequence clustering utilize greedy approaches that are not guaranteed to produce the best results. These tools are sensitive to one parameter that determines the similarity among sequences in a cluster. Often times, a biologist may not know the exact sequence similarity. Therefore, clusters produced by these tools do not likely match the real clusters comprising the data if the provided parameter is inaccurate. To overcome this limitation, we adapted the mean shift algorithm, an unsupervised machine-learning algorithm, which has been used successfully thousands of times in fields such as image processing and computer vision. The theory behind the mean shift algorithm, unlike the greedy approaches, guarantees convergence to the modes, e.g. cluster centers. Here we describe the first application of the mean shift algorithm to clustering DNA sequences. MeShClust is one of few applications of the mean shift algorithm in bioinformatics. Further, we applied supervised machine learning to predict the identity score produced by global alignment using alignment-free methods. We demonstrate MeShClust's ability to cluster DNA sequences with high accuracy even when the sequence similarity parameter provided by the user is not very accurate.
| S-EPMC6101578 | biostudies-literature