Results 61 to 70 of about 272,414 (271)
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
On the edit distance of powers of cycles
Discrete Mathematics, 2019 21 pages, 1 ...
Zhanar Berikkyzy +2 more
openaire +4 more sources
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
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
String correction using the Damerau-Levenshtein distance
BMC Bioinformatics, 2019 Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution ...
Chunchun Zhao, Sartaj Sahni
doaj +1 more source
Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]
, 2019 The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur +1 more
core +1 more source
Edit distance measure for graphs [PDF]
Czechoslovak Mathematical Journal, 2015 The edit number \(s(G,F)\) of two graphs \(G,F\) of order \(n\) is the minimum number of edges needed to be added/deleted from the graph \(G\) to obtain a graph isomorphic to \(F\). In this paper, the author provides values and bounds for \(g(n,l)\), the maximum number \(k\) for which there are \(l\) graphs of order \(n\), each two having edit distance
Dzido, Tomasz, Krzywdziński, Krzysztof
openaire +2 more sources
FEBS Letters, EarlyView.Mitochondrial remodeling shapes neural and glial lineage progression by matching metabolic supply with demand. Elevated OXPHOS supports differentiation and myelin formation, while myelin compaction lowers mitochondrial dependence, revealing mitochondria as key drivers of developmental energy adaptation.
Sahitya Ranjan Biswas +3 more
wiley +1 more source
FEBS Letters, EarlyView.Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source