Results 41 to 50 of about 3,689,343 (292)

Brain Tumor Segmentation Based on Minimum Spanning Tree

Frontiers in Signal Processing, 2022
In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters.
Simeon Mayala, Ida Herdlevær, Ida Herdlevær, Jonas Bull Haugsøen, Jonas Bull Haugsøen, Shamundeeswari Anandan, Shamundeeswari Anandan, Sonia Gavasso, Sonia Gavasso, Morten Brun   +9 more
doaj   +1 more source

Spanning trees with a bounded number of leaves [PDF]

Opuscula Mathematica, 2017
In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai, Evelyne Flandrin, Hao Li, Qiang Sun   +3 more
doaj   +1 more source

The Diameter and Maximum Link of the Minimum Routing Cost Spanning Tree Problem

Science and Technology Indonesia, 2022
The minimum routing cost spanning tree (MRCST) is a spanning tree that minimizes the sum of pairwise distances between its vertices given a weighted graph.
Reni Permata Sari, Wamiliana, Akmal Junaidi, Wiwin Susanty   +3 more
doaj   +3 more sources

Reconstructing enzyme evolution by protein engineering

FEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler, Markus R. Busch, Reinhard Sterner   +2 more
wiley   +1 more source

Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

Sensors, 2021
For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu, Yiran Ren, Zeeshan Abbas, Baili Zhang   +3 more
doaj   +1 more source

Unique circulating miRNAome signatures captured with distinct molecular states in Lynch syndrome and sporadic colorectal cancer

Molecular Oncology, EarlyView.
Circulating microRNA profiles distinguish nonmalignant Lynch syndrome from cancer‐associated Lynch syndrome, sporadic colorectal cancer, and healthy controls. Age‐stratified analysis reveals disease‐specific regulatory states, and a six‐miRNA panel shows concordant separation in an independent colorectal tissue cohort.
Ramadhani Salum Chambuso, Md Shohel Ul Islam, Rosa M Xicola, Raj Ramesar, Xavier Llor, Sinclair Steele   +5 more
wiley   +1 more source

Avidin is evolutionarily conserved in fish but dispensable for development and resistance against Streptococcus agalactiae in zebrafish

FEBS Open Bio, EarlyView.
The presence of biotin‐binding avidin proteins in fish and their biological significance are poorly characterized. We cataloged fish avidins and demonstrate that they are widely present and evolutionarily conserved. We created avd knockout zebrafish and show that zebavidin is dispensable for development and that resistance of avd knockout embryos in ...
Anni K. Saralahti, Markus J. T. Ojanen, Mataleena Parikka, Otto Kauko, Mika Rämet, Vesa P. Hytönen   +5 more
wiley   +1 more source

Beyond top‐N accuracy indicator: a comprehensive evaluation indicator of CNN models in image classification

IET Computer Vision, 2020
Nowadays, a large number of deep convolutional neural network (CNN) models are applied to image classification tasks. However, the authors find that the most widely used evaluation indicator, the Top‐N Accuracy indicator, cannot discriminate these models
Yuntao Liu, Yong Dou, Peng Qiao
doaj   +1 more source

Estimating the weight of metric minimum spanning trees in sublinear time [PDF]

, 2008
In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler, Artur Czumaj, Sohler, Christian, Czumaj, Artur   +3 more
core   +1 more source

A minimal cellulosome‐like system in Cellulosilyticum lentocellum

FEBS Open Bio, EarlyView.
Cellulose‐degrading bacteria typically use cellulosomes, large multi‐enzyme complexes on a scaffold protein. In Cellulosilyticum lentocellum, we characterise a far smaller arrangement, a single scaffold bound to one cellulase through a single cohesin‐dockerin interaction.
John Allan, Amias Alstrom‐Moore, Gary W Black   +2 more
wiley   +1 more source