Results 141 to 150 of about 59,128 (202)
GnnDebugger: GNN based error correction in De Bruijn Graphs. [PDF]
BMC BioinformaticsŠimunović M +3 more
europepmc +1 more source
An Uncontracted Epstein-Nesbet Perturbation Theory Approximation to SC-NEVPT2 Based on Spin-Pure Selected CI Wave Functions. [PDF]
J Chem Theory ComputUgandi M, Roemelt M.
europepmc +1 more source
The new metrics of Anais Brasileiros de Dermatologia. [PDF]
An Bras DermatolAlmeida HL +3 more
europepmc +1 more source
Morton Code-Based Geometry-Adaptive Surface Reconstruction. [PDF]
J ImagingHuang Z, Fan R, Miao Y.
europepmc +1 more source
Protocol for low-cost photographic digitization and automated HTML publication of envelope-preserved entomological museum collections. [PDF]
STAR ProtocTamagnini D, Chimenti C.
europepmc +1 more source
On prefix normal words and prefix normal forms
Theoretical Computer Science, 2017 A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given ...
Joe Sawada +2 more
exaly +4 more sources
Sorting by Prefix Reversals and Prefix Transpositions
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ulisses Dias, Zanoni Dias
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
J. Autom. Lang. Comb., 2021
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Sabine Broda +3 more
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Sabine Broda +3 more
openaire +2 more sources
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Richard E. Ladner, Michael J. Fischer
openaire +2 more sources