String Matching
Mostrando 1-12 de 15 artigos, teses e dissertações.
-
1. Perseus:uma nova técnica para tratar árvores de sufixo persistentes / Perseus: a novel technique to handle persistent suffix trees
Due to the technological advances in molecular biology laboratories, biological databases are extremely voluminous and tend to become more voluminous as data on new genome organisms are available. This introduces the challenge of searching nucleotide sequences efficiently. The suffix tree is an access method used for several applications that search for thes
Publicado em: 2009
-
2. Filtros para a busca e extração de padrões aproximados em cadeias biológicas / Filter Algorithms for Approximate Patterns Matching and Extraction from Biological Strings
Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se nos dois problemas a seguir, considerando-os sob as distâncias de Hamming e Levenshtein: a) como determinar os locais nos quais um dado padrão ocorre de modo aproximado em
Publicado em: 2008
-
3. Aplicação de autômatos finitos nebulosos no reconhecimento aproximado de cadeias. / The approximate string matching using fuzzy finite automata.
The approximate string matching problem is recurring in many applications where computer is used to process imprecise, fuzzy or spurious data. An uncountable number of methods, techniques and metrics to solve this class of problem are available, but many of them are inflexible at least in one of following: architecture, metric or application specifics. This
Publicado em: 2006
-
4. Ãndices Completos para Casamento de PadrÃes e InferÃncia de Motifs
Uma das maneiras mais eficientes (notadamente do ponto de vista computacional) empregada pela humanidade para a representaÃÃo da informaÃÃo tem sido atravÃs da forma de texto, ou seja, atravÃs de cadeias unimensionais de sÃmbolos (ou caracteres) tomados sobre conjuntos discretos finitos (ou alfabetos). As fecundas teorias, tÃcnicas e algoritmos desti
Publicado em: 2003
-
5. UNIVERSAL STRING MATCHING ENCODERS BY RECURRENCE OF STANDARDS FOR SOURCES WITH FINITE NUMBER OF STATES / CODIFICADORES UNIVERSAIS VIA RECORRÊNCIA DE PADRÕES PARA FONTES COM NÚMERO DE ESTADOS FINITO
Os codificadores universais via recorrência de padrões surgiram nos anos 70, quando foram propostos os codificadores lz77 e lz78. Devido a baixa complexidade computacional e ao bom desempenho, quando aplicados na compressão de arquivos de dados, estes codificadores se tornaram extremamente populares. Embora estes codificadores sejam universais, i.e., poss
Publicado em: 2000
-
6. Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language
Objective: The authors consider the problem of exact string pattern matching using algorithms that do not require any preprocessing. To choose the most appropriate algorithm, distinctive features of the medical language must be taken into account. The characteristics of medical language are emphasized in this regard, the best algorithm of those reviewe
American Medical Informatics Association.
-
7. MHCPEP: a database of MHC-binding peptides.
MHCPEP is a curated database comprising over 4000 peptide sequences known to bind MHC molecules. Entries are compiled from published reports as well as from direct submissions of experimental data. Each entry contains the source protein (when known), an estimate of binding affinity and critical anchor residues (if identified), and is fully referenced. The pr
-
8. MHCPEP--a database of MHC-binding peptides: update 1995.
MHCPEP is a curated database comprising over 6000 peptide sequences known to bind MHC molecules. Entries are compiled from published reports as well as from direct submissions of experimental data. Each entry contains peptide sequence, MHC specificity and when available, experimental method, observed activity, binding affinity, source protein, anchor positio
-
9. MHCPEP, a database of MHC-binding peptides: update 1996.
MHCPEP is a curated database comprising over 9000 peptide sequences known to bind MHC molecules. Entries are compiled from published reports as well as from direct submissions of experimental data. Each entry contains the peptide sequence, its MHC specificity and, when available, experimental method, observed activity, binding affinity, source protein, ancho
-
10. MHCPEP, a database of MHC-binding peptides: update 1997.
MHCPEP (http://wehih.wehi.edu.au/mhcpep/) is a curated database comprising over 13 000 peptide sequences known to bind MHC molecules. Entries are compiled from published reports as well as from direct submissions of experimental data. Each entry contains the peptide sequence, its MHC specificity and where available, experimental method, observed activity, bi
-
11. An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n. These algorithms allow mismatches, deletions and insertions. Algorithms to date run in O(mn) time. Let us define an integer, k, which is the maximal number of differences allowed. We
-
12. Assigning protein functions by comparative genome analysis: Protein phylogenetic profiles
Determining protein functions from genomic sequences is a central goal of bioinformatics. We present a method based on the assumption that proteins that function together in a pathway or structural complex are likely to evolve in a correlated fashion. During evolution, all such functionally linked proteins tend to be either preserved or eliminated in a new s
The National Academy of Sciences.