Detecting Corresponding Vertex Pairs between Planar Tessellation Datasets with Agglomerative Hierarchical Cell-Set Matching.
Ontology highlight
ABSTRACT:
SUBMITTER: Huh Y
PROVIDER: S-EPMC4922660 | biostudies-literature | 2016
REPOSITORIES: biostudies-literature
Publications
Detecting Corresponding Vertex Pairs between Planar Tessellation Datasets with Agglomerative Hierarchical Cell-Set Matching.
Huh Yong Y Yu Kiyun K Park Woojin W
PloS one 20160627 6
This paper proposes a method to detect corresponding vertex pairs between planar tessellation datasets. Applying an agglomerative hierarchical co-clustering, the method finds geometrically corresponding cell-set pairs from which corresponding vertex pairs are detected. Then, the map transformation is performed with the vertex pairs. Since these pairs are independently detected for each corresponding cell-set pairs, the method presents improved matching performance regardless of locally uneven po ...[more]
Similar Datasets
Project description:The tessellation of the Euclidean plane by regular polygons has been contemplated since ancient times and presents intriguing aspects embracing mathematics, art, and crystallography. Significant efforts were devoted to engineer specific 2D interfacial tessellations at the molecular level, but periodic patterns with distinct five-vertex motifs remained elusive. Here, we report a direct scanning tunneling microscopy investigation on the cerium-directed assembly of linear polyphenyl molecular linkers with terminal carbonitrile groups on a smooth Ag(111) noble-metal surface. We demonstrate the spontaneous formation of fivefold Ce-ligand coordination motifs, which are planar and flexible, such that vertices connecting simultaneously trigonal and square polygons can be expressed. By tuning the concentration and the stoichiometric ratio of rare-earth metal centers to ligands, a hierarchic assembly with dodecameric units and a surface-confined metal-organic coordination network yielding the semiregular Archimedean snub square tiling could be fabricated.
| S-EPMC3637743 | biostudies-literature
Project description:Clustering problems (including the clustering of individuals into outcrossing populations, hybrid generations, full-sib families and selfing lines) have recently received much attention in population genetics. In these clustering problems, the parameter of interest is a partition of the set of sampled individuals--the sample partition. In a fully Bayesian approach to clustering problems of this type, our knowledge about the sample partition is represented by a probability distribution on the space of possible sample partitions. As the number of possible partitions grows very rapidly with the sample size, we cannot visualize this probability distribution in its entirety, unless the sample is very small. As a solution to this visualization problem, we recommend using an agglomerative hierarchical clustering algorithm, which we call the exact linkage algorithm. This algorithm is a special case of the maximin clustering algorithm that we introduced previously. The exact linkage algorithm is now implemented in our software package PartitionView. The exact linkage algorithm takes the posterior co-assignment probabilities as input and yields as output a rooted binary tree, or more generally, a forest of such trees. Each node of this forest defines a set of individuals, and the node height is the posterior co-assignment probability of this set. This provides a useful visual representation of the uncertainty associated with the assignment of individuals to categories. It is also a useful starting point for a more detailed exploration of the posterior distribution in terms of the co-assignment probabilities.
| S-EPMC2705916 | biostudies-literature
Project description:Meghalaya, a state in the northeastern region of India, had a markedly low vaccine uptake compared to the other states in the country when COVID-19 vaccines were being rolled out in 2021. This study aimed to characterize the distinct vaccine-hesitant subpopulations in healthcare and community settings in Meghalaya state in the early days of the vaccination program. We used data from a cross-sectional survey that was administered to 200 healthcare workers (HCWs) and 200 community members, who were a priori identified as 'vaccine-eligible' and 'vaccine-hesitant,' in Shillong city, Meghalaya, in May 2021. The questionnaire collected information on participants' sociodemographic characteristics, COVID-19 history, and presence of medical comorbidities. Participants were also asked to provide a dichotomous answer to a set of 19 questions, probing the reasons for their hesitancy towards COVID-19 vaccines. A multiple correspondence analysis, followed by an agglomerative hierarchical cluster analysis, was performed to identify the distinct clusters of vaccine-hesitant participants. We identified seven clusters: indecisive HCWs (n = 71), HCWs skeptical of COVID-19 and COVID-19 vaccines (n = 128), highly educated male tribal/clan leaders concerned about infertility and future pregnancies (n = 14), less educated adults influenced by leaders and family (n = 47), older adults worried about vaccine safety (n = 76), middle-aged adults without young children (n = 56), and highly educated ethnic/religious minorities with misinformation (n = 8). Across all the clusters, perceived logistical challenges associated with receiving the vaccine was identified as a common factor contributing to vaccine hesitancy. Our study findings provide valuable insights for local and state health authorities to effectively target distinct subgroups of vaccine-hesitant populations with tailored health messaging, and also call for a comprehensive approach to address the common drivers of vaccine hesitancy in communities with low vaccination rates.
| S-EPMC10898751 | biostudies-literature
Project description:BackgroundWe represent the protein structure of scTIM with a graph-theoretic model. We construct a hierarchical graph with three layers - a top level, a midlevel and a bottom level. The top level graph is a representation of the protein in which its vertices each represent a substructure of the protein. In turn, each substructure of the protein is represented by a graph whose vertices are amino acids. Finally, each amino acid is represented as a graph where the vertices are atoms. We use this representation to model the effects of a mutation on the protein.MethodsThere are 19 vertices (substructures) in the top level graph and thus there are 19 distinct graphs at the midlevel. The vertices of each of the 19 graphs at the midlevel represent amino acids. Each amino acid is represented by a graph where the vertices are atoms in the residue structure. All edges are determined by proximity in the protein's 3D structure. The vertices in the bottom level are labelled by the corresponding molecular mass of the atom that it represents. We use graph-theoretic measures that incorporate vertex weights to assign graph based attributes to the amino acid graphs. The attributes of the corresponding amino acids are used as vertex weights for the substructure graphs at the midlevel. Graph-theoretic measures based on vertex weighted graphs are subsequently calculated for each of the midlevel graphs. Finally, the vertices of the top level graph are weighted with attributes of the corresponding substructure graph in the midlevel.ResultsWe can visualize which mutations are more influential than others by using properties such as vertex size to correspond with an increase or decrease in a graph-theoretic measure. Global graph-theoretic measures such as the number of triangles or the number of spanning trees can change as the result. Hence this method provides a way to visualize these global changes resulting from a small, seemingly inconsequential local change.ConclusionsThis modelling method provides a novel approach to the visualization of protein structures and the consequences of amino acid deletions, insertions or substitutions and provides a new way to gain insight on the consequences of diseases caused by genetic mutations.
| S-EPMC4155611 | biostudies-literature
Project description:A wealth of studies have shown that humans are remarkably poor at determining whether two face images show the same person or not (face matching). Given the prevalence of photo-ID, and the fact that people employed to check photo-ID are typically unfamiliar with the person pictured, there is a need to improve unfamiliar face matching accuracy. One method of improvement is to have participants complete the task in a pair, which results in subsequent improvements in the low performer ("the pairs training effect"). Here, we sought to replicate the original finding, to test the longevity of the pairs training effect, and to shed light on the potential underlying mechanisms. In two experiments, we replicated the pairs training effect and showed it is maintained after a delay (Experiment 1). We found no differences between high and low performers in confidence (Experiment 1) or response times (Experiment 2), and the content of the pairs' discussions (Experiment 2) did not explain the results. The pairs training effect in unfamiliar face matching is robust, but the mechanisms underlying the effects remain as yet unexplained.
| S-EPMC9203675 | biostudies-literature
Project description:The major interest domains of single-cell RNA sequential analysis are identification of existing and novel types of cells, depiction of cells, cell fate prediction, classification of several types of tumor, and investigation of heterogeneity in different cells. Single-cell clustering plays an important role to solve the aforementioned questions of interest. Cluster identification in high dimensional single-cell sequencing data faces some challenges due to its nature. Dimensionality reduction models can solve the problem. Here, we introduce a potential cluster specified frequent biomarkers discovery framework using dimensionality reduction and hierarchical agglomerative clustering Louvain for single-cell RNA sequencing data analysis. First, we pre-filtered the features with fewer number of cells and the cells with fewer number of features. Then we created a Seurat object to store data and analysis together and used quality control metrics to discard low quality or dying cells. Afterwards we applied global-scaling normalization method "LogNormalize" for data normalization. Next, we computed cell-to-cell highly variable features from our dataset. Then, we applied a linear transformation and linear dimensionality reduction technique, Principal Component Analysis (PCA) to project high dimensional data to an optimal low-dimensional space. After identifying fifty "significant"principal components (PCs) based on strong enrichment of low p-value features, we implemented a graph-based clustering algorithm Louvain for the cell clustering of 10 top significant PCs. We applied our model to a single-cell RNA sequential dataset for a rare intestinal cell type in mice (NCBI accession ID:GSE62270, 23,630 features and 1872 samples (cells)). We obtained 10 cell clusters with a maximum modularity of 0.885 1. After detecting the cell clusters, we found 3871 cluster-specific biomarkers using an expression feature extraction statistical tool for single-cell sequencing data, Model-based Analysis of Single-cell Transcriptomics (MAST) with a log 2 FC threshold of 0.25 and a minimum feature detection of 25%. From these cluster-specific biomarkers, we found 1892 most frequent markers, i.e., overlapping biomarkers. We performed degree hub gene network analysis using Cytoscape and reported the five highest degree genes (Rps4x, Rps18, Rpl13a, Rps12 and Rpl18a). Subsequently, we performed KEGG pathway and Gene Ontology enrichment analysis of cluster markers using David 6.8 software tool. In summary, our proposed framework that integrated dimensionality reduction and agglomerative hierarchical clustering provides a robust approach to efficiently discover cluster-specific frequent biomarkers, i.e., overlapping biomarkers from single-cell RNA sequencing data.
| S-EPMC8859265 | biostudies-literature
Project description:The vertex model is a popular framework for modelling tightly packed biological cells, such as confluent epithelia. Cells are described by convex polygons tiling the plane and their equilibrium is found by minimizing a global mechanical energy, with vertex locations treated as degrees of freedom. Drawing on analogies with granular materials, we describe the force network for a localized monolayer and derive the corresponding discrete Airy stress function, expressed for each N-sided cell as N scalars defined over kites covering the cell. We show how a torque balance (commonly overlooked in implementations of the vertex model) requires each internal vertex to lie at the orthocentre of the triangle formed by neighbouring edge centroids. Torque balance also places a geometric constraint on the stress in the neighbourhood of cellular trijunctions, and requires cell edges to be orthogonal to the links of a dual network that connect neighbouring cell centres and thereby triangulate the monolayer. We show how the Airy stress function depends on cell shape when a standard energy functional is adopted, and discuss implications for computational implementations of the model.
| S-EPMC7277128 | biostudies-literature
Project description:Hierarchical orthologous groups are defined as sets of genes that have descended from a single common ancestor within a taxonomic range of interest. Identifying such groups is useful in a wide range of contexts, including inference of gene function, study of gene evolution dynamics and comparative genomics. Hierarchical orthologous groups can be derived from reconciled gene/species trees but, this being a computationally costly procedure, many phylogenomic databases work on the basis of pairwise gene comparisons instead ("graph-based" approach). To our knowledge, there is only one published algorithm for graph-based hierarchical group inference, but both its theoretical justification and performance in practice are as of yet largely uncharacterised. We establish a formal correspondence between the orthology graph and hierarchical orthologous groups. Based on that, we devise GETHOGs ("Graph-based Efficient Technique for Hierarchical Orthologous Groups"), a novel algorithm to infer hierarchical groups directly from the orthology graph, thus without needing gene tree inference nor gene/species tree reconciliation. GETHOGs is shown to correctly reconstruct hierarchical orthologous groups when applied to perfect input, and several extensions with stringency parameters are provided to deal with imperfect input data. We demonstrate its competitiveness using both simulated and empirical data. GETHOGs is implemented as a part of the freely-available OMA standalone package (http://omabrowser.org/standalone). Furthermore, hierarchical groups inferred by GETHOGs ("OMA HOGs") on >1,000 genomes can be interactively queried via the OMA browser (http://omabrowser.org).
| S-EPMC3544860 | biostudies-literature
Project description:MotivationAnalysis of the omics data with the help of machine learning (ML) methods is limited by small sample sizes and a large number of variables. One possible approach to deal with such data is using algorithms for feature selection and reducing the dataset to include only those variables that are related to the studied phenomena. Existing simulators of the omics data were mostly developed with the goal of improving the methods for generations of high-quality data, that correspond with the highest possible fidelity to the real level of molecular markers in the biological materials. The current study aims to simulate the data on a higher level of generalization. Such datasets can then be used to perform tests of the feature selection and ML algorithms on systems that have structures mimicking those of real data, but where the ground truth may be implanted by design. They can also be used to generate contrast variables with the desired correlation structure for the feature selection.ResultsWe proposed the algorithm for the reconstruction of the omic dataset that, with high fidelity, preserves the correlation structure of the original data with a reduced number of parameters. It is based on the hierarchical clustering of variables and uses principal components of the clusters. It reproduces well topological descriptors of the correlation structure. The correlation structure of the principal components of the clusters then is used to obtain datasets with correlation structures similar to the original data but not correlated with the original variables.Availability and implementationThe code and data is available at: https://github.com/p100mma/hcrs_omics.
| S-EPMC11373347 | biostudies-literature
Project description:Mammalian genomes are folded in a hierarchy of compartments, topologically associating domains (TADs), subTADs and looping interactions. Here, we describe 3DNetMod, a graph theory-based method for sensitive and accurate detection of chromatin domains across length scales in Hi-C data. We identify nested, partially overlapping TADs and subTADs genome wide by optimizing network modularity and varying a single resolution parameter. 3DNetMod can be applied broadly to understand genome reconfiguration in development and disease.
| S-EPMC6029251 | biostudies-literature