Results 61 to 70 of about 1,895,967 (280)
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
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
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Evaluating Automatic Detection of Misspellings in German [PDF]
Language Learning and Technology, 2008 his study investigates the performance of a spell checker designed for native writers on misspellings made by second language (L2) learners. It addresses two research questions: 1) What is the correction rate of a generic spell checker for L2 ...
Anne Rimrott, Trude Heift
doaj
An edit distance for Reeb graphs
, 2016 We consider the problem of assessing the similarity of 3D shapes using Reeb graphs from the standpoint of robustness under perturbations. For this purpose, 3D objects are viewed as spaces endowed with real-valued functions, while the similarity between the resulting Reeb graphs is addressed through a graph edit distance.
Ulrich Bauer +2 more
openaire +4 more sources
The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation
FEBS Letters, EarlyView.Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge +6 more
wiley +1 more source
Chiral separation of chloroalkanes with the chromatographic column onboard Martian rovers
FEBS Letters, EarlyView.Computer image of the Rosalind Franklin Rover of ESA's ExoMars mission. ExoMars is scheduled to land on planet Mars in Oxia Planum in 2029. This area represents an interesting spot to look for biosignatures. Investigations of ExoMars include measurement on molecular chirality. We show that chiral chloroalkanes, that have been identified on Mars, can be
Asma Merzougui +4 more
wiley +1 more source
Prospecting the protein design landscape
FEBS Letters, EarlyView.This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source
Application of Genetic Algorithms for Finding Edit Distance between Process Models
Моделирование и анализ информационных систем, 2018 Finding graph-edit distance (graph similarity) is an important task in many computer science areas, such as image analysis, machine learning, chemicalinformatics.
Anna A. Kalenkova, Danil A. Kolesnikov
doaj +1 more source
Fast suboptimal algorithms for the computation of graph edit distance [PDF]
, 2006 Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of ...
Michel Neuhaus +5 more
core +1 more source