Suchergebnisse - "bit-parallel algorithms"

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Autoren: Kaneta, Yusaku Arimura, Hiroki Raman, Rajeev

Quelle: Journal of Discrete Algorithms. 14:119-135

Schlagwörter: Bit-parallel algorithms, Computational Theory and Mathematics, Unordered trees, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, XML queries, String matching, Tree matching, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Dateibeschreibung: Metadata

NEW EFFICIENT BIT-PARALLEL ALGORITHMS FOR THE (δ, α)-MATCHING PROBLEM WITH APPLICATIONS IN MUSIC INFORMATION RETRIEVAL

Autoren: CANTONE, Domenico CRISTOFARO S FARO, SIMONE

Quelle: International Journal of Foundations of Computer Science. 20:1087-1108

Schlagwörter: 05 social sciences, approximate string matching with gaps, bit-parallel algorithms, music information retrieval, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0509 other social sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.worldscientific.com/doi/abs/10.1142/S0129054109007054
https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs20.html#CantoneCF09
http://www.worldscinet.com/ijfcs/20/2006/S0129054109007054.html
https://doi.org/10.1142/S0129054109007054
https://hdl.handle.net/20.500.11769/6897

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

Autoren: Soares Neto, Domingos

Thesis Advisors: Soares, Jose Augusto Ramos

Schlagwörter: algoritmos bit-paralelos, algoritmos de filtragem, approximate string matching, árvores dos sufixos, bit-parallel algorithms, busca aproximada de padrões, extração de padrões, filter algorithms, motifs, patterns extraction, q-gramas, q-grams, suffix array, suffix tree, vetor dos sufixos

Dateibeschreibung: application/pdf

Verfügbarkeit: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/

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

Autoren: Domingos Soares Neto

Thesis Advisors: Jose Augusto Ramos Soares, Fabio Henrique Viduani Martinez, Jose Coelho de Pina Junior

Quelle: Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.

Schlagwörter: algoritmos bit-paralelos, algoritmos de filtragem, árvores dos sufixos, busca aproximada de padrões, extração de padrões, motifs, q-gramas, vetor dos sufixos, approximate string matching, bit-parallel algorithms, filter algorithms, patterns extraction, q-grams, suffix array, suffix tree

Verfügbarkeit: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/

New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences

Autoren: Domenico Cantone Salvatore Cristofaro Simone Faro et al.

Weitere Verfasser: Domenico Cantone Salvatore Cristofaro Simone Faro et al.

Quelle: http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D16%26t%3Dpdf%26y%3D2008.

Schlagwörter: approximate string matching with gaps, bit-parallel algorithms

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.5224

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.5224
http://www.stringology.org/cgi-bin/getfile.cgi?c%3D-%26n%3D16%26t%3Dpdf%26y%3D2008

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

Autoren: Soares Neto, Domingos Soares, Jose Augusto Ramos

Weitere Verfasser: Soares Neto, Domingos Soares, Jose Augusto Ramos

Schlagwörter: algoritmos bit-paralelos, q-gramas, motifs, vetor dos sufixos, extração de padrões, busca aproximada de padrões, algoritmos de filtragem, árvores dos sufixos, suffix tree, suffix array, q-grams, bit-parallel algorithms, patterns extraction, approximate string matching, filter algorithms

Dateibeschreibung: application/pdf

Verfügbarkeit: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/
https://doi.org/10.11606/D.45.2008.tde-19102009-002745