Results 51 to 60 of about 270,614 (275)
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
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars
Journal of Information and Telecommunication, 2020 A rooted labelled caterpillar (a caterpillar, for short) is a rooted labelled unordered tree transformed to a path after removing all the leaves in it. In this paper, we discuss two histogram distance between caterpillars.
Taiga Kawaguchi +2 more
doaj +1 more source
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
, 2015 Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem.
Al-Okaily, Anas
core +1 more source
Edit distance between unlabeled ordered trees [PDF]
RAIRO - Theoretical Informatics and Applications, 2004 Algorithmique et ...
Micheli, Anne, Rossin, Dominique
openaire +4 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
Algorithms, 2018 The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications.
Lila Kari +3 more
doaj +1 more source
3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data
BMC Bioinformatics, 2022 Background Third-generation sequencing offers some advantages over next-generation sequencing predecessors, but with the caveat of harboring a much higher error rate. Clustering-related sequences is an essential task in modern biology.
Robert Logan +6 more
doaj +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