Results 101 to 110 of about 38,188 (290)

Agrep - A Fast Approximate Pattern-Matching Tool

open access: yes, 1992
Searching for a pattern in a text file is a very common operation in many applications ranging from text editors and databases to applications in molecular biology. In many instances the pattern does not appear in the text exactly.
Sun Wu, Udi Manber
core  

Approximate one-to-one point pattern matching

open access: yesJournal of Discrete Algorithms, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Benkert   +3 more
openaire   +1 more source

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

open access: yesMolecular Oncology, EarlyView.
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic   +5 more
wiley   +1 more source

Graph Homomorphism Revisited for Graph Matching

open access: yes, 2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong   +4 more
core  

Approximate Pattern Matching Using The Burrows-Wheeler Transform

open access: yes, 2003
Summary form only given. The approximate pattern matching on the text transformed by the Burrows-Wheeler transform (BWT) was considered. This is an important first step towards developing a compressed pattern matching algorithm for the BWT based ...
Adjeroh, Don   +2 more
core   +1 more source

Approximate Online Pattern Matching in Sublinear Time [PDF]

open access: yes, 2019
We consider the approximate pattern matching problem under edit distance. In this problem we are given a pattern P of length m and a text T of length n over some alphabet Sigma, and a positive integer k.
Koucký, Michal   +2 more
core   +1 more source

Improved algorithms for approximate string matching (extended abstract)

open access: yesBMC Bioinformatics, 2009
Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios   +1 more
doaj   +1 more source

Can words be read without abstract letter identities?

open access: yesFrontiers in Psychology, 2014
Most theories of reading and writing posit a level of representation that codes abstract letter identities (ALIs) independent of the font, case, and even modality in which the letter was presented or produced (e.g., Caramazza & Hillis, 1990).
Simon Fischer-Baum
doaj   +1 more source

CD47 promotes mitogen‐activated protein kinase and epithelial‐to‐mesenchymal transition molecular programs to drive prometastatic phenotypes in non‐small cell lung cancer

open access: yesMolecular Oncology, EarlyView.
Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau   +8 more
wiley   +1 more source

Anytime and Distributed Approaches for Graph Matching

open access: yesELCVIA Electronic Letters on Computer Vision and Image Analysis, 2016
Due to the inherent genericity of graph-based representations, and thanks to the improvement of computer capacities, structural representations have become more and more popular in the field of Pattern Recognition (PR).
Zeina Abu-Aisheh
doaj   +1 more source

Home - About - Disclaimer - Privacy