Results 91 to 100 of about 1,275,858 (359)
Algorithms of maximum likelihood data clustering with applications
, 2002 We address the problem of data clustering by introducing an unsupervised, parameter free approach based on maximum likelihood principle. Starting from the observation that data sets belonging to the same cluster share a common information, we construct ...
Alter +17 more
core +1 more source
SmallTalk: a novel small‐sized fusion tag for peptide expression and purification
FEBS Open Bio, EarlyView.The SmallTalk fusion tag allows for the efficient expression and purification of soluble recombinant proteins or peptides in Escherichia coli. Testing with SmallTalk‐GFP confirmed that the proteins were soluble and folded correctly, while SmallTalk‐Bin1b maintained its antimicrobial activity against various bacterial isolates. This streamlined workflow
Atika Tariq +3 more
wiley +1 more source
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets [PDF]
, 1997 This paper introduces new algorithms and data structures for quick counting for machine learning datasets. We focus on the counting task of constructing contingency tables, but our approach is also applicable to counting the number of records in a ...
Lee, M. S., Moore, A.
core +3 more sources
FEBS Open Bio, EarlyView.RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees [PDF]
Logical Methods in Computer ScienceParity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (STOC 2017). The combinatorial object underlying these approaches is a universal tree, as identified by Czerwiński et al. (SODA 2019).
Zhuan Khye Koh, Georg Loho
doaj +1 more source
Algorithms Visualization Tool for Students and Lectures in Computer Science
, 2013 The best way to understand complex data structures or algorithm is to see them in action. The present work presents a new tool, especially useful for students and lecturers in computer science.
Musumbu, Kaninda
core +1 more source
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
Investigation of candidate data structures and search algorithms to support a knowledge based fault diagnosis system [PDF]
The focus of this research is the investigation of data structures and associated search algorithms for automated fault diagnosis of complex systems such as the Hubble Space Telescope.
Bosworth, Edward L., Jr.
core +1 more source
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source