Results 151 to 160 of about 772 (221)

Refining Boolean models with the partial most permissive scheme. [PDF]

Bioinformatics
Ben Boina N, Mossé B, Baudot A, Remy E.
europepmc   +1 more source

k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5 [PDF]

Dupré la Tour, Max, Lafond, Manuel, Ndiaye, Ndiamé, Vetta, Adrian   +3 more
openalex   +1 more source

RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs. [PDF]

Algorithms Mol Biol
Boury T, Gardelle S, Bulteau L, Ponty Y.
europepmc   +1 more source

Vertex Deletion into Bipartite Permutation Graphs. [PDF]

Algorithmica, 2022
Bożyk Ł, Derbisz J, Krawczyk T, Novotná J, Okrasa K.   +4 more
europepmc   +1 more source

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs

, 2015
Konrad K. Dabrowski, Daniël Paulusma
openalex   +4 more sources

Hardware-tailored diagonalization circuits. [PDF]

npj Quantum Inf
Miller D, Fischer LE, Levi K, Kuehnke EJ, Sokolov IO, Barkoutsos PK, Eisert J, Tavernelli I.   +7 more
europepmc   +1 more source

Permutation-Based Distances for Groups and Group-Valued Time Series. [PDF]

Entropy (Basel)
Amigó JM, Dale R.
europepmc   +1 more source

Computing a maximum clique in geometric superclasses of disk graphs. [PDF]

J Comb Optim, 2022
Grelier N.
europepmc   +1 more source

Forbidden subgraphs and bounds on the size of a maximum matching [PDF]

, 2005
Michael D. Plummer, Akira Saito
openalex   +1 more source

mRNA folding algorithms for structure and codon optimization. [PDF]

Brief Bioinform
Ward M, Richardson M, Metkar M.
europepmc   +1 more source