Results 61 to 70 of about 83,132 (184)
Bioinformática : identificar genes en una interfaz gráfica vía web para la comparación de genomas [PDF]
, 2010 Este trabajo desarrolla el proceso de diseño e implementación de una interfaz web que permite la exploración en detalle de las relaciones entre genomas completos.
Babitsch Soler, Ivan +3 more
core
Indexed Hierarchical Approximate String Matching [PDF]
, 2008 We present a new search procedure for approximate string matching over suffix trees. We show that hierarchical verification, which is a well-established technique for on-line searching, can also be used with an indexed approach. For this, we need that the index supports bidirectionality, meaning that the search for a pattern can be updated by adding a ...
Luís M. S. Russo +2 more
openaire +1 more source
Cache-Oblivious Index for Approximate String Matching [PDF]
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, TW +4 more
openaire +4 more sources
Key Frame Extraction for Text Based Video Retrieval Using Maximally Stable Extremal Regions
EAI Endorsed Transactions on e-Learning, 2015 This paper presents a new approach for text-based video content retrieval system. The proposed scheme consists of three main processes that are key frame extraction, text localization and keyword matching.
Werachard Wattanarachothai +1 more
doaj +1 more source
Finding scientific articles in a large digital archive: BioStor and the Biodiversity Heritage Library [PDF]
, 2010 The Biodiversity Heritage Library (BHL) is a large digital archive of legacy biological literature, comprising over 31 million pages scanned from books, monographs, and journals.
Roderic Page
core +1 more source
Order-Preserving Pattern Matching with Partition
MathematicsOrder-preserving pattern matching, which considers the relative orders of strings, can be applied to time-series data analysis. To perform a more meaningful analysis of time-series data, approximate criteria for the order-isomorphism are necessary ...
Joong Chae Na +3 more
doaj +1 more source
, 2019 This thesis addresses important algorithms and data structures used in sequence analysis for applications such as read mapping. First, we give an overview on state-of-the-art FM indices and present the latest improvements. In particular, we will introduce a recently published FM index based on a new data structure: EPR dictionaries.
openaire +1 more source
Database Index for Approximate String Matching
Proceedings of the Spring/Summer Young Researchers' Colloquium on Software Engineering, 2010 In this work the database index for approximate string search is proposed. In particular the task of finding strings from some data domain which have a distance from given string less than given number is considered. Some kind of editorial string distance is used in capacity of string distance.
openaire +2 more sources
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree [PDF]
, 2019 Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the pattern $P[1..m]$.
Equi, Massimo +2 more
core +2 more sources
Approximate string matching with address bit errors
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir, Amihood +4 more
openaire +1 more source