Results 51 to 60 of about 18,990 (308)
Fast equality test for straight-line compressed strings [PDF]
, 2011 The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.
Schmidt-Schauß, Manfred +1 more
core
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
ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2012 The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Peter Burcsi +3 more
openaire +4 more sources
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Algorithms for strings and sequences: Searching motifs [PDF]
, 2019 Strings, sequences and, ultimately, motifs play a key role in bioinformatics. Here, a motif is a biologically relevant pattern occurring in one or more input sequences. In this chapter, first we provide a formal definition of strings, sequences, matches,
Francesco Cauteruccio +5 more
core +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
An approximate string-matching algorithm
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong Yong Kim, John Shawe-Taylor
openaire +1 more source
Advanced Engineering Materials, EarlyView.Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk) [PDF]
, 2016 The collection indexing problem is defined as follows: Given a collection of highly similar strings, build a compressed index for the collection of strings, and when a pattern is given, find all occurrences of the pattern in the given strings.
Park, Kunsoo
core +1 more source