Terminology Service < Semantic Lookup Platform

All terms in ONE

Label	Id	Description
small-animal image acquisition device	OBI_0001077	[A device that is used to image small laboratory animals (e.g., rats and mice) in vivo.]
incubator shaker	OBI_0001076	[An incubating device that provides shaking motion for biomedical applications (e.g., cell cultures).]
hybridization oven	OBI_0001075	[A device that creates an appropriate environment for nucleic acid hybridization.]
incubator	OBI_0000136	[A device in which environmental conditions (light, photoperiod, temperature, humidity, etc.) can be controlled]
cryofixation device	OBI_0001074	[A device that is used for the fixation or stabilization of biological materials as the first step in specimen preparation for electron microscopy.]
microtome knife maker	OBI_0001073	[A glass cutting and breaking device that is used to produce glass knives used in ultramicrotomy.]
movement quality	PATO_0001906	[A physical quality inhering in a bearer by virtue of the bearer's participation in movement.]
physical quality	PATO_0001018	[A quality of a physical entity that exists through action of continuants at the physical level of organisation in relation to other entities.]
cryostat	OBI_0001072	[A device consisting of a vessel, similar in construction to a vacuum flask, that is used to maintain cold cryogenic temperatures. FIX THIS DEFINITION]
programmable array microscope	OBI_0001071	[A confocal microscope that uses a programmable spatial light modulator for generating an arbitrary pattern of conjugate illumination and detection apertures.]
modular decomposition	OBI_0200040	[Molecular decomposition is the partition of a network into distinct subgraphs for the purpose of identifying functional clusters. The network data is run through any of several existing algorithms designed to partition a network into distinct subgraphs for the purpose of isolating groups of functionally linked biological elements such as proteins.]
k-means clustering	OBI_0200041	[A k-means clustering is a data transformation which achieves a class discovery or partitioning objective, which takes as input a collection of objects (represented as points in multidimensional space) and which partitions them into a specified number k of clusters. The algorithm attempts to find the centers of natural clusters in the data. The most common form of the algorithm starts by partitioning the input points into k initial sets, either at random or using some heuristic data. It then calculates the mean point, or centroid, of each set. It constructs a new partition by associating each point with the closest centroid. Then the centroids are recalculated for the new clusters, and the algorithm repeated by alternate applications of these two steps until convergence, which is obtained when the points no longer switch clusters (or alternatively centroids are no longer changed).]
complete linkage hierarchical clustering	OBI_0200044	[an agglomerative hierarchical clustering which generates successive clusters based on a distance measure, where the distance between two clusters is calculated as the maximum distance between objects from the first cluster and objects from the second cluster.]
software application	IAO_0000594	[A software application is software that can be directly executed by some processing unit.]
software	IAO_0000010	[Software is a plan specification composed of a series of instructions that can be interpreted by or directly executed by a processing unit.]
average linkage hierarchical clustering	OBI_0200043	[An average linkage hierarchical clustering is an agglomerative hierarchical clustering which generates successive clusters based on a distance measure, where the distance between two clusters is calculated as the average distance between objects from the first cluster and objects from the second cluster.]
software script	IAO_0000595	[A software script is software whose instructions can be executed using a software interpreter.]
single linkage hierarchical clustering	OBI_0200045	[A single linkage hierarchical clustering is an agglomerative hierarchical clustering which generates successive clusters based on a distance measure, where the distance between two clusters is calculated as the minimum distance between objects from the first cluster and objects from the second cluster.]
written name	IAO_0000590	[A textual entity that denotes a particular in reality.]
software method	IAO_0000591	[A software method (also called subroutine, subprogram, procedure, method, function, or routine) is software designed to execute a specific task.]