Results 51 to 60 of about 148,669 (285)
Space-efficient detection of unusual words
, 2015 Detecting all the strings that occur in a text more frequently or less frequently than expected according to an IID or a Markov model is a basic problem in string mining, yet current algorithms are based on data structures that are either space ...
A Apostolico +8 more
core +1 more source
Prospects and limitations of full-text index structures in genome analysis [PDF]
, 2012 The combination of incessant advances in sequencing technology producing large amounts of data and innovative bioinformatics approaches, designed to cope with this data flood, has led to new interesting results in the life sciences.
Dawyndt, Peter +3 more
core +2 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
Input–output maps are strongly biased towards simple outputs
Nature Communications, 2018 Algorithmic information theory measures the complexity of strings. Here the authors provide a practical bound on the probability that a randomly generated computer program produces a given output of a given complexity and apply this upper bound to RNA ...
Kamaludin Dingle +2 more
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 Functional Materials, EarlyView.A previously unreported coordination motif stabilising single Fe atoms by indigo chelation and pyridyl coordination on Au(111) has been revealed. By using planar tritopic pyridyl linkers (TPyB), extended 2D porous networks of indigo3(TPyB)2Fe6 form. These networks can be crystalline or vitreous and offer an environment where individual coordination ...
Hongxiang Xu +9 more
wiley +1 more source
A Superficial Analysis Approach for Identifying Malicious Domain Names Generated by DGA Malware
IEEE Open Journal of the Communications Society, 2020 Some of the most serious security threats facing computer networks involve malware. To prevent malware-related damage, administrators must swiftly identify and remove the infected machines that may reside in their networks. However, many malware families
Akihiro Satoh +3 more
doaj +1 more source
Fuzzy Authentication using Rank Distance
, 2017 Fuzzy authentication allows authentication based on the fuzzy matching of two objects, for example based on the similarity of two strings in the Hamming metric, or on the similiarity of two sets in the set difference metric.
A Cossidente +8 more
core +1 more source
Algorithm engineering : string processing [PDF]
, 2016 The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms.
openaire +2 more sources
ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS [PDF]
International Journal of Foundations of Computer Science, 2005 Computing approximate patterns in strings or sequences has important applications in DNA sequence analysis, data compression, musical text analysis, and so on. In this paper, we introduce approximate k-covers and study them under various commonly used distance measures.
Lili Zhang, Francine Blanchet-Sadri
openaire +1 more source