Results 21 to 30 of about 147,630 (190)
Fast Arc-Annotated Subsequence Matching in Linear Space [PDF]
, 2010 An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$ can be obtained ...
D. Harel +10 more
core +3 more sources
Consistent Unsupervised Estimators for Anchored PCFGs
Transactions of the Association for Computational Linguistics, 2020 Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of ...
Clark, Alexander, Fijalkow, Nathanaël
doaj +1 more source
Using Avida to test the effects of natural selection on phylogenetic reconstruction methods [PDF]
, 2004 Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but different methods sometimes give conflicting results.
Hagstrom, George I. +3 more
core +1 more source
Rotation of bits: a classical and quantum perspective
Journal of Electrical Systems and Information Technology, 2021 Bit rotation is an operation similar to shift except that the bits that fall off at one end are put back to the other end. In left rotation, the bits that fall off at left end are put back at right end.
Peter Nimbe +2 more
doaj +1 more source
Small Longest Tandem Scattered Subsequences
Scientific Annals of Computer Science, 2021 We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.
Luıs M. S. Russo +1 more
doaj +1 more source
AN ADAPTIVE HYBRID PATTERN-MATCHING ALGORITHM ON INDETERMINATE STRINGS [PDF]
International Journal of Foundations of Computer Science, 2009 We describe a hybrid pattern-matching algorithm that works on both regular and indeterminate strings. This algorithm is inspired by the recently proposed hybrid algorithm FJS and its indeterminate successor. However, as discussed in this paper, because of the special properties of indeterminate strings, it is not straightforward to directly migrate ...
Smyth, Bill, Wang, S.
openaire +3 more sources
Identifying all abelian periods of a string in quadratic time and relevant problems [PDF]
, 2012 Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were given.
Christou, Michalis +2 more
core +4 more sources
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Occurrences Algorithm for String Searching Based on Brute-force Algorithm [PDF]
Journal of Computer Science, 2006 This study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text.
Ababneh Mohammad +2 more
openaire +1 more source
Modeling emergence of Wolbachia toxin-antidote protein functions with an evolutionary algorithm
Frontiers in Microbiology, 2023 Evolutionary algorithms (EAs) simulate Darwinian evolution and adeptly mimic natural evolution. Most EA applications in biology encode high levels of abstraction in top-down population ecology models.
John Beckmann +2 more
doaj +1 more source