Results 51 to 60 of about 1,791,230 (278)

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, Yu-jun HAN, Xuan WANG, Jun-feng ZHOU   +3 more
doaj   +2 more sources

Association Between Individualized Education for Kidney Replacement Therapy Modality Selection and Peritoneal Dialysis Initiation: A Cross‐Sectional Study

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito, Ryuichi Yoshimura, Takaki Yamauchi, Yuta Funakoshi, Hirotaka Sonoda, Seiji Kobayashi, Hiroyuki Terawaki, Takafumi Ito   +7 more
wiley   +1 more source

Bayesian graph edit distance [PDF]

Proceedings 10th International Conference on Image Analysis and Processing, 2000
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem.
Myers, R., Hancock, E.R., Wilson, R.C.
openaire   +2 more sources

The Reeb Graph Edit Distance is Universal [PDF]

Foundations of Computational Mathematics, 2020
AbstractWe consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it provides an upper bound to ...
Ulrich Bauer, Claudia Landi 0001, Facundo Mémoli   +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, Konstantinos Makryniotis, Theofani‐Iosifina Sousani, Evangelos Topakas, Vangelis Daskalakis, Maria Dimarogona   +5 more
wiley   +1 more source

A Quadratic Programming Approach to the Graph Edit Distance Problem [PDF]

, 2007
. In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths ...
Michel Neuhaus, Horst Bunke, Neuhaus, Michel, Bunke, Horst   +3 more
core   +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

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, Takuya Yoshino, Kouichi Hirata   +2 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, Zoe Fleischmann, Sofia Annis, Amy Wangsness Wehe, Jonathan L. Tilly, Dori C. Woods, Konstantin Khrapko   +6 more
doaj   +1 more source

Residual tail twisting in ascidian larvae is stabilized by asymmetric myofibrils that resist bilateral symmetry restoration

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, Misaki K. Nishio, Satoru Okuda, Kohji Hotta   +3 more
wiley   +1 more source