Results 61 to 70 of about 274,129 (290)
Readjoiner: a fast and memory efficient string graph-based sequence assembler
BMC Bioinformatics, 2012 Background Ongoing improvements in throughput of the next-generation sequencing technologies challenge the current generation of de novo sequence assemblers. Most recent sequence assemblers are based on the construction of a de Bruijn graph.
Gonnella Giorgio, Kurtz Stefan
doaj +1 more source
Quantum search for a given substring in the text using a hashing technique
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 The problem of searching for a given substring in the text was considered. It is known that classical algorithms solve this problem in a linear time depending on the length of the text and the specified template. Quantum algorithms speed up the search by
N.M. Salikhova
doaj +1 more source
Overlap of the Wilson loop with the broken-string state
, 2004 Numerical experiments on most gauge theories coupled with matter failed to observe string-breaking effects while measuring Wilson loops only. We show that, under rather mild assumptions, the overlap of the Wilson loop operator with the broken-string ...
A. Rago +37 more
core +1 more source
Open String Diagrams I: Topological Type [PDF]
, 1992 An arbitrary Feynman graph for string field theory interactions is analysed and the homeomorphism type of the corresponding world sheet surface is completely determined even in the non-orientable cases.
Nag, Subhashis, Sankaran, Parameswaran
core +2 more sources
Superionic Amorphous Li2ZrCl6 and Li2HfCl6
Advanced Materials, EarlyView.Amorphous Li2HfCl6 and L2ZrCl6 are shown to be promising solid‐state electrolytes with predicted ionic conductivities >20 mS·cm−1. Molecular dynamics simulations with machine‐learning force fields reveal that anion vibrations and flexible MCl6 octahedra soften the Li coordination cage and enhance mobility. Correlation between Li‐ion diffusivity and the
Shukai Yao, De‐en Jiang
wiley +1 more source
Reconstruction algorithms for DNA-storage systems
Scientific ReportsMotivated by DNA storage systems, this work presents the DNA reconstruction problem, in which a length-n string, is passing through the DNA-storage channel, which introduces deletion, insertion and substitution errors.
Omer Sabary +3 more
doaj +1 more source
BIOS, 2020 String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm.
Candra Irawan, Mudafiq Riyan Pratama
doaj +1 more source
Evolution of Materials and Device Stacks for HfO2‐Based Ferroelectric Memories
Advanced Materials Interfaces, EarlyView.This review summarizes engineering strategies for HfO2 based ferroelectric memories with focus on FeCAP and FeFET structures. It describes how dopant design, stress effects, and interface engineering improve the bulk ferroelectric response. It further discusses how channel engineering supports reliable memory characteristics and scalable integration ...
Eunjin Kim, Jiyong Woo
wiley +1 more source
Iraqi Journal for Computers and InformaticsAlgorithms for string matching are considered one of the most extensively researched topics in the field of computer science due to their substantial role in various applications, such as information retrieval, editing, security, firewalls, and ...
Hayder kamil AL-Jazayiri +1 more
doaj +1 more source
Random Access to Grammar Compressed Strings
, 2011 Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes.
Bille, Philip +5 more
core +1 more source