Results 71 to 80 of about 147,630 (190)
New Algorithms for δγ-Order Preserving Matching
Ingeniería, 2018 Context: Order-preserving matching regards the relative order of strings. However, its application areas require more flexibility in the matching paradigm. We advance in this direction in this paper that extends our previous work [27]. Method: We define
Juan Mendivelso +3 more
doaj +1 more source
On the Border Length Minimization Problem (BLMP) on a Square Array
, 2010 Protein/Peptide microarrays are rapidly gaining momentum in the diagnosis of cancer. High-density and highthroughput peptide arrays are being extensively used to detect tumor biomarkers, examine kinase activity, identify antibodies having low serum ...
Dinh, Hieu +2 more
core +1 more source
Algorithmic View on Circular String Attractors
, 2023 The notion of circular string attractor has been recently introduced by Mantaci et al. [TCS 2021]. It consists of a set Γc of positions in a word such that each distinct circular factor has at least an occurrence crossing one of the elements of Γc. Its definition is an extension of the notion of string attractor by Kempa and Prezza [STOC 2018], which ...
openaire +1 more source
Distributed string matching algorithm on the N-cube [PDF]
, 1996 In this paper, we present a distributed algorithm which runs on the N-cube and solves the string matching problem. A basic prefixsuffix matching technique is used as a building block for the construction of the algorithm. As opposed to the parallel algorithms so far designed on shared-memory PRAM models, our algorithm runs distributively on fixed ...
Fouzia Moussouni, Christian Lavault
openaire +1 more source
Safe and complete contig assembly via omnitigs
, 2016 Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs -- a set of strings that are promised to appear in any genome that could have generated the reads.
A Bankevich +35 more
core +1 more source
Discovering Data Set Nature through Algorithmic Clustering Based on String Compression
IEEE Transactions on Knowledge and Data Engineering, 2015 Text datasets can be represented using models that do not preserve text structure, or using models that preserve text structure. Our hypothesis is that depending on the dataset nature, there can be advantages using a model that preserves text structure over one that does not, and viceversa.
Granados, Ana +2 more
openaire +3 more sources
Efficient motif finding algorithms for large-alphabet inputs
BMC Bioinformatics, 2010 Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact ...
Pavlovic Vladimir, Kuksa Pavel P
doaj +1 more source
On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation
BRICS Report Series, 2005 We present the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the `bad-character-shift' heuristic as a binding-time improvement, bounded static variation.
Danvy, Olivier, Rohde, Henning Korsholm
openaire +4 more sources
Damerau Levenshtein Distance for Indonesian Spelling Correction
Jurnal Informatika, 2019 Word correction used to find an incorrect word in writing. Levenshtein distance is one of algorithm to correcting typing error. It is an algorithm that calculates a difference between two strings.
Puji Santoso +3 more
doaj +1 more source
BMC Bioinformatics, 2018 Background Given a set of t n-length DNA sequences, q satisfying 0
Qiang Yu, Dingbang Wei, Hongwei Huo
doaj +1 more source