Results 231 to 240 of about 270,614 (275)

deepNGS navigator: exploring antibody NGS datasets using deep contrastive learning. [PDF]

open access: yesBioinformatics
MohammadiPeyhani H   +4 more
europepmc   +1 more source

Biological Network Edit Distance

Journal of Computational Biology, 2016
Interactions among biological entities contain more information than purely the similarities between the entities. For example, interactions between genes, and gene products, can be more informative than the sequence similarities of the genes involved.
Martin, McGrane, Michael A, Charleston
openaire   +2 more sources

Markov edit distance

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
Edit distance was originally developed by Levenstein several decades ago to measure the distance between two strings. It was found that this distance can be computed by an elegant dynamic programming procedure. The edit distance has played important roles in a wide array of applications due to its representational efficacy and computational efficiency.
openaire   +2 more sources

Segmentation Edit Distance

2018 24th International Conference on Pattern Recognition (ICPR), 2018
In this paper, we present a novel distance metric called Segmentation Edit Distance (SED) and its use as a segmentation evaluation metric. In segmentation evaluation, the difference or distance of a test segmentation and the associated ground truth segmentation are measured in order to compare different algorithms.
Daniel Pucher, Walter G. Kropatsch
openaire   +1 more source

Swap and mismatch edit distance

Algorithmica, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir, Amihood   +2 more
openaire   +2 more sources

Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Fundamenta Informaticae, 2009
This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h +
Aratsu, Taku   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy