Results 91 to 100 of about 16,265 (145)

Machine learning can distinguish orphans that have resulted from sequence divergence beyond recognition. [PDF]

Bioinform Adv
Tassios E, de Leuw J, Nikolaou C, Kupczok A, Vakirlis N.   +4 more
europepmc   +1 more source

CCNV: a user-friendly R package enabling large-scale cumulative copy number variation analyses of DNA methylation data. [PDF]

BMC Bioinformatics
Gocke A, Schumann Y, Navolić J, Godbole S, Schoof M, Dottermusch M, Neumann JE.   +6 more
europepmc   +1 more source

Visual Quantitative Characterization of External Corrosion in 3LPE Coated Pipes Based on Microwave Near-Field Reflectometry and Phase Unwrapping. [PDF]

Sensors (Basel)
Li W.
europepmc   +1 more source

Enabling rapid and accurate grand discrimination of flue-cured tobacco: a near-infrared hyperspectral and machine learning approach. [PDF]

Front Plant Sci
Zou J, Gao H, Wang D, Chen Y, Deng S, Shi N, Yang S, Huang C, Zi D, Du Y, Bai Y, Wang N, Wang G, Liu Z, Zhang J, Zhou P.   +15 more
europepmc   +1 more source

Thrombectomy for medium-sized cerebral vessel occlusion: Size does matter. [PDF]

Eur Stroke J
Virtanen P, Räty S, Tomppo L, Brandstack N, Peltola E, Kokkonen T, Sillanpää M, Strbian D.   +7 more
europepmc   +1 more source

Efficient Branch-and-Cut Algorithms for Submodular Function Maximization

Efficient Branch-and-Cut Algorithms for Submodular Function Maximization
openaire  

Some of the next articles are maybe not open access.

Related searches:

Declawing a graph: polyhedra and Branch-and-Cut algorithms

Journal of Combinatorial Optimization, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Felipe C. Fragoso, Gilberto F. de Sousa Filho, Fábio Protti   +2 more
openaire   +1 more source

Branch‐and‐cut algorithms for the ‐arborescence star problem

International Transactions in Operational Research, 2020
AbstractGiven a connected digraph, a vertex designated as the root, and an integer , the ‐arborescence star problem is to choose vertices besides the root and define a reverse arborescence spanning them. Each vertex outside the arborescence must be assigned to one vertex inside it.
Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia   +2 more
openaire   +1 more source

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audet, C., Savard, G., Zghal, W.
openaire   +1 more source