Výsledky vyhľadávania - "string searching algorithm"

PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE

Autori: Atheer Akram AbdulRazzaq Nur'Aini Abdul Rashid

Zdroj: Iraqi Journal for Computers and Informatics, Vol 48, Iss 2, Pp 1-8 (2022)

Predmety: Parallel computing, Technology, Artificial intelligence, openmp directive, Regular Expression Matching, Approximate Matching, Speedup, 7. Clean energy, Pattern Matching, Artificial Intelligence, Biochemistry, Genetics and Molecular Biology, String searching algorithm, String (physics), FOS: Mathematics, parallel execution time, Pattern matching, Molecular Biology, Algorithms and Architectures for Packet Classification, database types, Prediction of Protein Subcellular Localization, speedup, Text Compression and Indexing Algorithms, Statistics, Life Sciences, Computer science, Algorithm, Parallel algorithm, Hardware and Architecture, e-abdulrazzaq algorithm, Mathematical physics, Computer Science, Physical Sciences, Matching (statistics), String Matching, Mathematics

Prístupová URL adresa: https://doaj.org/article/9fb96dad5e5c49d2a73bc31421ebca8c

A new fast technique for pattern matching in biological sequences

Autori: Osman Ali Sadek Ibrahim Belal A. Hamed Tarek Abd El‐Hafeez

Zdroj: The Journal of Supercomputing. 79:367-388

Predmety: Parallel computing, FOS: Computer and information sciences, 0301 basic medicine, Artificial intelligence, Character (mathematics), Bioinformatics, Word (group theory), 0206 medical engineering, Approximate Matching, Word error rate, Geometry, 02 engineering and technology, Pattern recognition (psychology), Speedup, 03 medical and health sciences, Pattern Matching, Artificial Intelligence, Biochemistry, Genetics and Molecular Biology, Hashing, String searching algorithm, FOS: Mathematics, Genetics, RNA Sequencing Data Analysis, Pattern matching, Molecular Biology, Data mining, Biology, Algorithms and Architectures for Packet Classification, Text Compression and Indexing Algorithms, Statistics, Life Sciences, Computer science, Process (computing), Algorithm, Biological data, Operating system, Hardware and Architecture, FOS: Biological sciences, Computer Science, Physical Sciences, sequence alignment, Matching (statistics), String Matching, Mathematics, Sequence (biology)

Evaluation of the Boyer-Moore and Knuth-Morris-Pratt String-Searching

Autori: Lolo, Rim

Predmety: String searching algorithm, Boyer-Moore, Knuth-Morris-Pratt, String matching, Factorial analysis, Engineering and Technology, Teknik

Popis súboru: application/pdf

Dostupnosť: http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-46653

Role of Distance Measures in Approximate String Matching Algorithms for Face Recognition System

Autori: B. Venkata Krishnaveni S. Sridhar Ifip, Hal a ďalší

Prispievatelia: B. Venkata Krishnaveni S. Sridhar Ifip, Hal a ďalší

Zdroj: IFIP Advances in Information and Communication Technology ISBN: 9783030634667

Predmety: Artificial intelligence, Shape Matching, Face (sociological concept), Jaro distance, Edit distance, 0211 other engineering and technologies, Image Retrieval, 02 engineering and technology, [INFO] Computer Science [cs], Pattern recognition (psychology), Face Recognition, Image Feature Retrieval and Recognition Techniques, Hamming distance, Sociology, LCSS, Shape Matching and Object Recognition, String searching algorithm, String (physics), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Longest common subsequence problem, Face recognition, Pattern matching, Facial recognition system, Object Recognition, Approximate string matching, Statistics, Hamming, String metric, Social science, Approximation algorithm, Computer science, FOS: Sociology, Algorithm, Mathematical physics, Computer Science, Physical Sciences, Matching (statistics), Approximate, String matching, Computer Vision and Pattern Recognition, Commentz-Walter algorithm, Face Recognition and Dimensionality Reduction Techniques, Feature Matching, Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://link.springer.com/chapter/10.1007/978-3-030-63467-4_12
https://hal.inria.fr/hal-03434787

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections

Autori: Felipe A. Louza Guilherme P. Telles Simon Gog a ďalší

Zdroj: Algorithms Mol Biol
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-5 (2020)

Predmety: 0301 basic medicine, Artificial intelligence, String collections, Search engine indexing, QH426-470, 01 natural sciences, String (physics), Generalized suffix tree, Suffix Arrays, Biology (General), Suffix, Text Compression and Indexing Algorithms, Life Sciences, Prefix, Programming language, FOS: Philosophy, ethics and religion, Algorithm, Data structure, Mathematical physics, Physical Sciences, String Matching, Document array, Trie, Burrows–Wheeler transform, Burrows-Wheeler transform, LCP array, Suffix array, QH301-705.5, Construct (python library), 0102 computer and information sciences, 03 medical and health sciences, Suffix tree, Theoretical computer science, Artificial Intelligence, Biochemistry, Genetics and Molecular Biology, Support Vector Machines, Genetics, String searching algorithm, FOS: Mathematics, RNA Sequencing Data Analysis, Molecular Biology, Prediction of Protein Subcellular Localization, Linguistics, Compressed suffix array, Computer science, Software Article, Philosophy, Computer Science, FOS: Languages and literature, Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://almob.biomedcentral.com/track/pdf/10.1186/s13015-020-00177-y
https://pubmed.ncbi.nlm.nih.gov/32973918
https://doaj.org/article/5cf5db694d514e1eab49f2be29d24638
https://arpi.unipi.it/handle/11568/1061178
https://almob.biomedcentral.com/articles/10.1186/s13015-020-00177-y
https://doi.org/10.1186/s13015-020-00177-y
https://dblp.uni-trier.de/db/journals/almob/almob15.html#LouzaTGPR20
https://pubmed.ncbi.nlm.nih.gov/32973918/
https://link.springer.com/content/pdf/10.1186/s13015-020-00177-y.pdf
https://hdl.handle.net/11568/1061178
https://doi.org/10.1186/s13015-020-00177-y
https://almob.biomedcentral.com/articles/10.1186/s13015-020-00177-y

Generalized enhanced suffix array construction in external memory

Autori: Felipe A. Louza Guilherme P. Telles Steve Hoffmann a ďalší

Zdroj: Algorithms Mol Biol
Algorithms for Molecular Biology, Vol 12, Iss 1, Pp 1-16 (2017)
Algorithms for molecular biology, 12:26

Predmety: String collections, 02 engineering and technology, QH426-470, External memory algorithms, 01 natural sciences, String (physics), Generalized suffix tree, Suffix Arrays, Biology (General), Auxiliary memory, Suffix, Text Compression and Indexing Algorithms, Life Sciences, Programming language, FOS: Philosophy, ethics and religion, Algorithm, Hardware and Architecture, Data structure, Mathematical physics, Physical Sciences, Heap (data structure), String Matching, Burrows–Wheeler transform, LCP array, QH301-705.5, Regular Expression Matching, Construct (python library), 0206 medical engineering, 0102 computer and information sciences, Suffix tree, Theoretical computer science, Artificial Intelligence, Biochemistry, Genetics and Molecular Biology, Suffix array, Genetics, String searching algorithm, FOS: Mathematics, RNA Sequencing Data Analysis, Molecular Biology, Algorithms and Architectures for Packet Classification, Research, Computer hardware, Linguistics, Compressed suffix array, Computer science, Philosophy, Computer Science, FOS: Languages and literature, Mathematics

Prístupová URL adresa: https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0117-9
https://pubmed.ncbi.nlm.nih.gov/29234460
https://doaj.org/article/bc8337213dc2403ea213db794ca99cb2
https://repository.publisso.de/resource/frl:6410897

Multithreaded Sliding Window Approach to Improve Exact Pattern Matching Algorithms

Autori: Ala'a Al-shdaifat Basam Hammo Mohammad A. M. Abushariah a ďalší

Zdroj: International Journal of Advanced Computer Science and Applications. 8

Predmety: Parallel computing, Artificial intelligence, Thread (computing), Regular Expression Matching, Sliding window protocol, Approximate Matching, Geometry, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Pattern Matching, Artificial Intelligence, Multithreading, String searching algorithm, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Pattern matching, Window (computing), Algorithms and Architectures for Packet Classification, Text Compression and Indexing Algorithms, Statistics, Statistical Machine Translation and Natural Language Processing, Computer science, Intrusion Detection, Algorithm, Operating system, Hardware and Architecture, Computer Science, Physical Sciences, Matching (statistics), String Matching, Block (permutation group theory), Mathematics

Prístupová URL adresa: http://thesai.org/Downloads/Volume8No1/Paper_55-Multithreaded_Sliding_Window_Approach.pdf
https://thesai.org/Downloads/Volume8No1/Paper_55-Multithreaded_Sliding_Window_Approach.pdf
https://thesai.org/Publications/ViewPaper?Volume=8&Issue=1&Code=ijacsa&SerialNo=55

Efficient repeat finding in sets of strings via suffix arrays

Autori: Barenbaum, Pablo Becher, Verónica Deymonnaz, Alejandro a ďalší

Zdroj: CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas

Predmety: 0301 basic medicine, Artificial intelligence, Substring, DNA-based Computing and Data Storage, Generalized suffix tree, String (physics), Suffix Arrays, Pattern matching, Stringology, Suffix, 0303 health sciences, Text Compression and Indexing Algorithms, Life Sciences, Discrete mathematics, FOS: Philosophy, ethics and religion, Programming language, Algorithm, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Hardware and Architecture, Data structure, Mathematical physics, Physical Sciences, String Matching, Approximate Matching, Set (abstract data type), 03 medical and health sciences, Pattern Matching, Suffix tree, Artificial Intelligence, Biochemistry, Genetics and Molecular Biology, Hashing, Suffix array, String searching algorithm, FOS: Mathematics, Molecular Biology, Algorithms and Architectures for Packet Classification, Approximate string matching, Longest Maximal Substring, Linguistics, Repeats, Compressed suffix array, Computer science, Suffix Array, Philosophy, Combinatorics, Computer Science, Computation, FOS: Languages and literature, Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://dmtcs.episciences.org/597/pdf
https://dmtcs.episciences.org/597
https://doi.org/10.46298/dmtcs.597
https://hal.archives-ouvertes.fr/hal-00980753v1
https://hal.inria.fr/hal-00980753
https://hal.inria.fr/hal-00980753/document
https://dmtcs.episciences.org/597/pdf
https://dblp.uni-trier.de/db/journals/dmtcs/dmtcs15.html#BarenbaumBDHH13
http://dmtcs.episciences.org/597
http://hdl.handle.net/11336/2502

Short Answer Grading Using String Similarity And Corpus-Based Similarity

Autori: Wael Hassan Gomaa Aly A. Fahmy

Zdroj: International Journal of Advanced Computer Science and Applications. 3

Predmety: Artificial intelligence, Effectiveness of Intelligent Tutoring Systems, Geometry, 02 engineering and technology, Pattern recognition (psychology), Semantic Similarity, Engineering, Artificial Intelligence, Machine learning, String (physics), String searching algorithm, FOS: Mathematics, Image (mathematics), 0202 electrical engineering, electronic engineering, information engineering, Similarity (geometry), Civil engineering, Pattern matching, 10. No inequality, Data mining, Natural Language Processing, Natural language processing, 4. Education, Word Representation, Statistical Machine Translation and Natural Language Processing, Grading (engineering), String metric, Computer science, Correlation, Mathematical physics, Computer Science, Physical Sciences, Mathematics, FOS: Civil engineering

Prístupová URL adresa: http://thesai.org/Downloads/Volume3No11/Paper_19-Short_Answer_Grading_Using_String_Similarity_And_Corpus-Based_Similarity.pdf
https://thesai.org/Downloads/Volume3No11/Paper_19-Short_Answer_Grading_Using_String_Similarity_And_Corpus-Based_Similarity.pdf
https://thesai.org/Publications/ViewPaper?Volume=3&Issue=11&Code=IJACSA&SerialNo=19

Generating Performance Analysis of GPU compared to Single-core and Multi-core CPU for Natural Language Applications

Autori: Shubham Gupta M. Rajasekhara Babu

Zdroj: International Journal of Advanced Computer Science and Applications. 2

Predmety: Parallel computing, Artificial intelligence, Central processing unit, 7. Clean energy, Multicore Architectures, Parallel Computing, Artificial Intelligence, Interleaving, Parallel Computing and Performance Optimization, String searching algorithm, GPU Computing, 14. Life underwater, Pattern matching, Algorithms and Architectures for Packet Classification, Multi-core processor, Single-core, Text Compression and Indexing Algorithms, Performance Optimization, 1. No poverty, Computer hardware, Computer science, Operating system, Hardware and Architecture, 13. Climate action, Computer Science, Physical Sciences, String Matching

Prístupová URL adresa: http://thesai.org/Downloads/Volume2No5/Paper%208-Performance%20Analysis%20of%20GPU%20compared%20to%20Single-core%20and%20Multi-core%20CPU%20for%20Natural%20Language%20Applications.pdf
https://thesai.org/Downloads/Volume2No5/Paper%208-Performance%20Analysis%20of%20GPU%20compared%20to%20Single-core%20and%20Multi-core%20CPU%20for%20Natural%20Language%20Applications.pdf
https://thesai.org/Publications/ViewPaper?Volume=2&Issue=5&Code=IJACSA&SerialNo=8

A string searching algorithm

Autori: Vincent Alia S. Sitharama Iyengar

Zdroj: Applied Mathematics and Computation. 6:123-131

Predmety: Discrete mathematics in relation to computer science, matching, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, string searching algorithm

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3664382
https://doi.org/10.1016/0096-3003(80)90037-5
https://www.sciencedirect.com/science/article/pii/0096300380900375

Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation

Autori: Dubois, Simon

Predmety: Algorithm comparison, Approximate string matching, Information retrieval, Offline string matching, Overlap coefficient, Phonetic indexation, String distance, String metric, String searching algorithm

Popis súboru: application/pdf

Dostupnosť: http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-22566

Možnosti využití sufixových stromů ; Suffix Trees Capabilities

Autori: Chlubna, Pavel Burgetová, Ivana Hynek, Jiří

Prispievatelia: Chlubna, Pavel Burgetová, Ivana Hynek, Jiří

Predmety: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity

Popis súboru: application/pdf; text/html

Relation: CHLUBNA, P. Možnosti využití sufixových stromů [online]. Brno: Vysoké učení technické v Brně. Fakulta informačních technologií. 2020.; 129103; http://hdl.handle.net/11012/191682

Dostupnosť: http://hdl.handle.net/11012/191682

Gaining efficiency on the word-length string searching algorithm

Autori: Mhashi, Mahmoud M.

Predmety: Computing methodologies for text processing, mathematical typography, Pattern recognition, speech recognition, string searching algorithm, Searching and sorting

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1240733

Možnosti využití sufixových stromů

Autori: Burgetová, Ivana Hynek, Jiří Chlubna, Pavel

Témy: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity, Text

URL: http://hdl.handle.net/11012/191682

Možnosti využití sufixových stromů

Autori: Burgetová, Ivana Hynek, Jiří Chlubna, Pavel

Témy: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity, Text

URL: http://hdl.handle.net/11012/191682

Možnosti využití sufixových stromů

Autori: Burgetová, Ivana Hynek, Jiří

Témy: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity, Text

URL: http://hdl.handle.net/11012/191682

Možnosti využití sufixových stromů

Autori: Burgetová, Ivana Hynek, Jiří

Témy: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity, Text

URL: http://hdl.handle.net/11012/191682

Možnosti využití sufixových stromů

Autori: Burgetová, Ivana Hynek, Jiří Chlubna, Pavel

Témy: Sufixový strom, Ukkonenův algoritmus, dynamické programování, algoritmy pro vyhledávání v textu, porovnávání vzorů, časová náročnost, Suffix tree, Ukkonen's algorithm, dynamic programming, string-searching algorithm, pattern matching, time complexity, Text

URL: http://hdl.handle.net/11012/191682