Results 61 to 70 of about 37,210 (201)
Small, EarlyView.This review critically compares the electrochemical performance of carbon‐based and alloy‐type anodes for sodium‐ion batteries, with an emphasis on strategies that enhance practical deployment. It highlights how synergistic optimization of microstructure, electrolyte, and presodiation improves hard carbon, while nanostructuring and interfacial ...
Anele Tshaka +3 more
wiley +1 more source
Skip the alignment: degenerate, multiplex primer and probe design using K-mer matching instead of alignments. [PDF]
PLoS ONE, 2012 PriMux is a new software package for selecting multiplex compatible, degenerate primers and probes to detect diverse targets such as viruses. It requires no multiple sequence alignment, instead applying k-mer algorithms, hence it scales well for large ...
David A Hysom +5 more
doaj +1 more source
Algorithms to Compute the Lyndon Array [PDF]
, 2016 We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given.
Franek, Frantisek +3 more
core +1 more source
Representing the Suffix Tree with the CDAWG [PDF]
, 2017 Given a string T, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with e_T arcs, taking overall O(e_T+e_REV(T)) words of space, where REV(T) is the reverse of T, and supporting some key operations
Belazzougui, Djamal, Cunial, Fabio
core +2 more sources
Scalable Parallel Suffix Array Construction [PDF]
Parallel Computing, 2006 Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first implementation and experimental evaluation of a scalable parallel algorithm for suffix array construction.
Kulla, F., Sanders, P.
openaire +3 more sources
Flexural performance of concrete‐filled steel tubular beams with wood chip aggregate
Structural Concrete, EarlyView.Abstract This study investigates the flexural performance of concrete‐filled steel tubular (CFST) beams with partial replacement of aggregates by wood chips (0%–25%) through experimental and numerical analysis. This study is novel in that it experimentally and numerically investigates the flexural behavior of CFST beams with partial replacement of ...
Mizan Ahmed +6 more
wiley +1 more source
Approximate String Matching with Compressed Indexes
Algorithms, 2009 A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +1 more source
A Fast Algorithm for the Largest Area First Parsing of Real Strings
IEEE Access, 2020 The largest area first parsing of a string often leads to the best results in grammar compression for a variety of input data. However, the fastest existing algorithm has Θ(N2 log N) time complexity, which makes it impractical for real-life ...
Ivan Katanic +2 more
doaj +1 more source
Model‐Based Cybersecurity: Automating Common Vulnerabilities Reporting
Systems Engineering, EarlyView.ABSTRACT The Common Vulnerabilities and Exposures (CVE) Program's mission is to identify, define, and catalog publicly disclosed cybersecurity vulnerabilities. A cybersecurity practitioner who suspects a software, hardware, or service vulnerability, can initiate a CVE‐ID Requesting process, as defined by MITRE.
Ahmad Jbara, Dov Dori
wiley +1 more source
Suffix sorting via matching statistics
Algorithms for Molecular BiologyWe introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a reference ...
Zsuzsanna Lipták +2 more
doaj +1 more source