Results 41 to 50 of about 50,367 (275)
Penilaian Kesamaan Entity Relationship Diagram dengan Algoritme Tree Edit Distance
Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2017 Main competency in database learning is ability to design Entity Relationship Diagram (ERD). Generally, lecturer gives task to students to design an ERD with some requirements. These ERDs are then assessed by comparing them with the answers. In practice,
Humasak Simanjuntak +5 more
doaj +1 more source
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding
IEEE AccessIn many biological research studies that rely on DNA sequence data, calculating the edit distance between two sequences is a vital component. However, computing the edit distance involves dynamic programming, which can be computationally intensive.
Kyelim Lee, Albert No
doaj +1 more source
An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems [PDF]
, 2015 International audienceGraph edit distance is an error tolerant matching technique emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning and data mining; it ...
Abu-Aisheh, Zeina +3 more
core +3 more sources
Edit distance between unlabeled ordered trees [PDF]
RAIRO - Theoretical Informatics and Applications, 2004 Algorithmique et ...
Micheli, Anne, Rossin, Dominique
openaire +4 more sources
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
Edit Distance: Sketching, Streaming and Document Exchange
, 2016 We show that in the document exchange problem, where Alice holds $x \in \{0,1\}^n$ and Bob holds $y \in \{0,1\}^n$, Alice can send Bob a message of size $O(K(\log^2 K+\log n))$ bits such that Bob can recover $x$ using the message and his input $y$ if the
Belazzougui, Djamal, Zhang, Qin
core +1 more source
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
Edit Distance between Merge Trees
IEEE Transactions on Visualization and Computer Graphics, 2020 Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of sub-level and super-level sets in a scalar field.
Raghavendra Sridharamurthy +3 more
openaire +3 more sources
Proceedings of the Sixth Workshop on Structured Prediction for NLP, 2022 We propose the neural string edit distance model for string-pair matching and string transduction based on learnable string edit distance. We modify the original expectation-maximization learned edit distance algorithm into a differentiable loss function, allowing us to integrate it into a neural network providing a contextual representation of the ...
Libovický, Jindřich, Fraser, Alexander
openaire +3 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source