Results 71 to 80 of about 5,721,874 (232)
Algorithms on Grammar-Compressed Strings [PDF]
, 2011 Grammar based compression, where one replaces a long string by a small contextfree grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur and Re-Pair.
openaire +1 more source
Survey and Comparison of String Matching Algorithms [PDF]
, 2021 There are many applications which makes use of pattern matching algorithm. Most of current websites implements pattern matching algorithm in order to display the results faster. There exist different kind of data such as image, text, video, audio.
et. al., Chayapathi A R,
core +1 more source
Efficient top-k string similarity query algorithms
Tongxin xuebao, 2014 Computing top-k similar strings based on edit distance,i.e.,given a query string σ and string set S,finding k similar strings to σ based on edit distance from S.Firstly,two adaptive filter strategies based on length-skip index are proposed,such that to ...
Zi-yang CHEN +3 more
doaj +2 more sources
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 To appear in the proceedings of RANDOM ...
Sofya Raskhodnikova +3 more
openaire +6 more sources
Can You Solve Closest String Faster Than Exhaustive Search? [PDF]
, 2023 We study the fundamental problem of finding the best string to represent a given set, in the form of the Closest String problem: Given a set X ⊆ Σ^d of n strings, find the string x^* minimizing the radius of the smallest Hamming ball around x^* that ...
Fischer, Nick +4 more
core +1 more source
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
Deconvolution in Measurements of Muon Neutrino Energy Spectra with IceCube [PDF]
EPJ Web of Conferences, 2019 As the energy of an incident neutrino cannot be accessed experimentally, muon neutrino energy spectra have to be inferred from energy-dependent observables, using deconvolution algorithms.
Ruhe Tim
doaj +1 more source
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Suffix Tree Construction and Storage with Limited Main Memory [PDF]
, 2003 Schürmann K-B, Stoye J. Suffix Tree Construction and Storage with Limited Main Memory. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld; 2003.Suffix trees have been established as one of the most versatile index structures for
Schürmann, Klaus-Bernd +1 more
core +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