Results 31 to 40 of about 40,634 (160)
Pattern Matching on Sparse Suffix Trees [PDF]
, 2011 International audienceWe consider a compact text index based on evenly spaced sparse suffix trees of a text [9]. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start
Kolpakov, Roman +2 more
core +7 more sources
Doubts on Irish Iubhar 'Yew Tree' and Eburacum or York [PDF]
Вопросы ономастики, 2019 York, a cathedral city in the north of England, was the Eburacum or Colonia Eburacensis of Roman Britain. Its name has usually been explained from Irish iubhar ‘yew tree’ (or alternatively from Welsh efwr ‘hogweed’) and so ‘place where yew trees grow ...
Andrew Breeze
doaj +1 more source
Linear-Time Text Compression by Longest-First Substitution
Algorithms, 2009 We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol.
Ayumi Shinohara +5 more
doaj +1 more source
Fast parallel construction of variable-length Markov chains
BMC Bioinformatics, 2021 Background Alignment-free methods are a popular approach for comparing biological sequences, including complete genomes. The methods range from probability distributions of sequence composition to first and higher-order Markov chains, where a k-th order ...
Joel Gustafsson +3 more
doaj +1 more source
New Algorithms for Position Heaps
, 2013 We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the ...
A. Ehrenfeucht +7 more
core +1 more source
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source
Feature-Based and String-Based Models for Predicting RNA-Protein Interaction
Molecules, 2018 In this work, we study two approaches for the problem of RNA-Protein Interaction (RPI). In the first approach, we use a feature-based technique by combining extracted features from both sequences and secondary structures.
Donald Adjeroh +6 more
doaj +1 more source
The Anatomical Record, EarlyView.Abstract The middle Permian represents a critical interval in therapsid evolution, when gorgonopsians emerged as some of the first specialized apex predators within terrestrial ecosystems. Despite their significance, the early diversification of Gorgonopsia in Gondwana remains poorly understood due to scarcity and fragmentary material.
Zanildo Macungo +5 more
wiley +1 more source
String Indexing for Patterns with Wildcards [PDF]
, 2012 We consider the problem of indexing a string $t$ of length $n$ to report the occurrences of a query pattern $p$ containing $m$ characters and $j$ wildcards. Let $occ$ be the number of occurrences of $p$ in $t$, and $\sigma$ the size of the alphabet.
A. Tam +18 more
core +2 more sources
Biological Reviews, EarlyView.ABSTRACT Oropharyngeal food processing exhibits a remarkable diversity among vertebrates, reflecting the evolution of specialised ‘processing centres’ associated with the mandibular, hyoid, and branchial arches. Although studies have detailed various food‐processing strategies and mechanisms across vertebrates, a coherent and comprehensive terminology ...
Daniel Schwarz +6 more
wiley +1 more source