Search Results - "String algorithms"
-
1
Authors: et al.
Contributors: et al.
Source: Theory of Computing Systems
Subject Terms: String algorithms, Elastic-degenerate strings, string algorithms, approximate string matching, edit distance, Hamming distance, elastic-degenerate strings, Approximate string matching, Elastic-degenerate string, Edit distance, String algorithm, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]
File Description: application/pdf
Access URL: https://link.springer.com/article/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558
https://hdl.handle.net/1871.1/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://doi.org/10.1007/s00224-024-10194-8
https://research.vu.nl/en/publications/fbd19d3a-5431-453a-a3e0-8cd5b1a5b811
https://inria.hal.science/hal-04747458v1
https://doi.org/10.1007/s00224-024-10194-8
https://inria.hal.science/hal-04747458v1/document
https://hdl.handle.net/2434/1131036
https://doi.org/10.1007/s00224-024-10194-8
https://link.springer.com/article/10.1007/s00224-024-10194-8
https://doi.org/10.1007/s00224-024-10194-8
https://hdl.handle.net/11368/3091558 -
2
Authors: et al.
Contributors: et al.
Source: Information and Computation. 307:105357
Subject Terms: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), T-NDAS, String Algorithms, Computer Science - Data Structures and Algorithms, Finite Automata, Subsequences, Regular Languages, Computer Science - Formal Languages and Automata Theory, Data Structures and Algorithms (cs.DS), ddc:004, Software
File Description: application/pdf
-
3
Authors: et al.
Source: Data Min Knowl Discov
Subject Terms: String algorithms, String sanitization, string algorithm, forbidden pattern, missing value replacement, string sanitization, string algorithms, forbidden patterns, Forbidden patterns, Missing value replacement, Article
File Description: application/pdf
Access URL: https://pubmed.ncbi.nlm.nih.gov/39867462
https://research.vu.nl/en/publications/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/1871.1/8a02a50e-06d3-4836-aac0-8c0e0992a4bd
https://hdl.handle.net/2434/1138695
https://doi.org/10.1007/s10618-024-01074-3
https://hdl.handle.net/11368/3096431 -
4
Authors: et al.
Contributors: et al.
Source: Algorithmica
Subject Terms: String algorithms, Record linkage, String algorithms Dictionary matching Wildcards Record linkage, Query term dropping, 4. Education, Wildcards, Dictionary matching, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]
File Description: application/pdf
Access URL: https://hdl.handle.net/1871.1/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://doi.org/10.1007/s00453-024-01213-8
https://research.vu.nl/en/publications/7db223ca-663b-47f1-9c0e-c2ab8c68cf98
https://inria.hal.science/hal-04747475v1
https://inria.hal.science/hal-04747475v1/document
https://doi.org/10.1007/s00453-024-01213-8 -
5
Authors: et al.
Contributors: et al.
Subject Terms: String algorithms, grammar-based compression, ddc:004, data compression, random access
File Description: application/pdf
-
6
Authors: et al.
Contributors: et al.
Subject Terms: compressed data structures, Computer and information sciences, pattern matching, ddc:004, string algorithms, compression, indexing
File Description: application/pdf
-
7
Authors:
Contributors:
Subject Terms: Longest Common Prefix, String Algorithms, ddc:004, Data Structures
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Subject Terms: String algorithms, succinct data structures, suffix trees, ddc:004, Burrows-Wheeler transformation
File Description: application/pdf
-
9
Authors: et al.
Contributors: et al.
Source: Bernardini, G, Chen, H, Loukides, G & Pissis, S P 2025, 'On String and Graph Sanitization', OpenAccess Series in Informatics, vol. 132, pp. 9:1-9:10. https://doi.org/10.4230/OASIcs.Grossi.9
Subject Terms: graph algorithms, data privacy, data sanitization, graph algorithm, string algorithm, ddc:004, string algorithms
File Description: application/pdf
Access URL: https://hdl.handle.net/1871.1/9eb0c27e-ee74-44a9-945b-f01384060438
https://doi.org/10.4230/OASIcs.Grossi.9
https://research.vu.nl/en/publications/9eb0c27e-ee74-44a9-945b-f01384060438
https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Grossi.9
https://kclpure.kcl.ac.uk/ws/files/353845480/OASIcs.Grossi.9.pdf -
10
Authors: et al.
Contributors: et al.
Subject Terms: compressed data structures, data structures, weighted de Bruijn sequence, Computer and information sciences, succinct data structures, ddc:004, text indexing, string algorithms, data compression
File Description: application/pdf
-
11
Authors: et al.
Contributors: et al.
Subject Terms: general unordered alphabet, decision tree complexity, minimal generator, ddc:004, string algorithms, walking on words, palindromic substrings
File Description: application/pdf
-
12
Authors: et al.
Contributors: et al.
Source: Loukidis, G, Pissis, S & Sweering, M 2023, ' Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search ', IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, pp. 1-18 . https://doi.org/10.1109/TKDE.2022.3231780
Loukidis, G, Pissis, S & Sweering, M 2023, ' Bidirectional String Anchors for Improved Text Indexing and Top-K Similarity Search ', IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, vol. 35, no. 11, pp. 11093-11111 . https://doi.org/10.1109/TKDE.2022.3231780
IEEE Transactions on Knowledge and Data Engineering
King's Research Portal
NARCIS
ORCIDSubject Terms: String algorithms, top-K string similarity search, Computational Theory and Mathematics, 0202 electrical engineering, electronic engineering, information engineering, top-K similarity search, 02 engineering and technology, string sampling, text indexing, string algorithms, Computer Science Applications, Information Systems
File Description: application/pdf
-
13
Authors: et al.
Contributors: et al.
Source: Theoretical Computer Science
NARCIS
arXiv.org e-Print Archive
Hal-Diderot
Mémoires en Sciences de l'Information et de la Communication
Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
Datacite
ORCID
32nd Annual Symposium on Combinatorial Pattern Matching (CPM), 2021, Wroclaw, Poland
Theoretical Computer Science, 922, 271-282. Elsevier
Badkobeh, G, Charalampopoulos, P, Kosolobov, D & Pissis, S P 2022, ' Internal shortest absent word queries in constant time and linear space ', Theoretical Computer Science, vol. 922, pp. 271-282 . https://doi.org/10.1016/j.tcs.2022.04.029
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-13
32nd Annual Symposium on Combinatorial Pattern Matching (CPM)
CPM 2021-32nd Annual Symposium on Combinatorial Pattern MatchingSubject Terms: String algorithms, FOS: Computer and information sciences, CONSTANT TIME, BIT PARALLELISM, General Computer Science, INTERNAL QUERIES, INTERNAL SHORTS, INTERNAL QUERY, Internal queries, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, TIME-SPACE, Theoretical Computer Science, SHORTEST ABSENT WORD, PREPROCESS, STRING ALGORITHMS, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Shortest absent word, SHORT ABSENT WORD, Bit parallelism, LINEAR SPACES, internal queries, string algorithms, SPACE DATA STRUCTURES, COMPUTATIONAL METHODS, bit parallelism, shortest absent word, SDG 4 - Quality Education
File Description: application/pdf
Access URL: http://arxiv.org/abs/2106.01763
https://research.gold.ac.uk/id/eprint/31912/7/Range_Absent_Words.pdf
https://hdl.handle.net/1871.1/ed3be6f7-164c-4b5e-ac9c-0a6c5d697b53
https://doi.org/10.1016/j.tcs.2022.04.029
https://research.vu.nl/en/publications/ed3be6f7-164c-4b5e-ac9c-0a6c5d697b53
https://inria.hal.science/hal-03498358v1
http://elar.urfu.ru/handle/10995/117865
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129567862&doi=10.1016/j.tcs.2022.04.029&partnerID=40&md5=85ce4247332146740284ad07a75067f3 -
14
Authors:
Source: ACM Transactions on Algorithms
Bringmann, K, Cohen-Addad, V & Das, D 2023, ' A Linear-Time n 0.4-Approximation for Longest Common Subsequence ', ACM Transactions on Algorithms, vol. 19, no. 1, 9 . https://doi.org/10.1145/3568398Subject Terms: FOS: Computer and information sciences, Longest common subsequence, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, F.2.2, approximation algorithms, string algorithms, 68W32, 68W25, 01 natural sciences
File Description: application/pdf
-
15
Authors: et al.
Contributors: et al.
Source: Bille, P, Farach-Colton, M, Gørtz, I L & van der Hoog, I 2024, ' Snake in Optimal Space and Time ', Leibniz International Proceedings in Informatics, LIPIcs, vol. 291, pp. 3:1-3:15 . https://doi.org/10.4230/LIPIcs.FUN.2024.3
Subject Terms: Nokia, Snake, Data structure, String Algorithms, ddc:004
File Description: application/pdf
-
16
Authors: et al.
Source: Lecture Notes in Networks and Systems ISBN: 9783031731242
Subject Terms: String algorithms, Combinatorial algorithms, Quantum computing
-
17
Authors: et al.
Contributors: et al.
Subject Terms: String algorithms, FOS: Computer and information sciences, pattern matching, conditional lower bounds, fine-grained complexity, parameterised complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, subsequences with gap constraints
File Description: application/pdf
-
18
Authors:
Subject Terms: APX-hardness, LCS, String Algorithms
File Description: application/pdf
Access URL: https://hdl.handle.net/10446/296087
-
19
Authors: et al.
Contributors: et al.
Subject Terms: Finite Automata, Regular Languages, String Algorithms, Subsequences, Software, T-NDAS
File Description: application/pdf
Relation: 34th International Symposium on Algorithms and Computation, ISAAC 2023; Leibniz International Proceedings in Informatics, LIPIcs; 302433007; 85179139394; conference; https://hdl.handle.net/10023/29996
-
20
Authors: et al.
Contributors: et al.
Subject Terms: Burrows-Wheeler transform, BWT, compressed data structures, de Bruijn graph, k-mer, LCP, longest common prefix, longest common suffix, string algorithms, Computer and information sciences
File Description: application/pdf
Relation: String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Proceedings; Lecture Notes in Computer Science; conference; http://hdl.handle.net/10138/585997; 85174435971; 001156335700001
Availability: http://hdl.handle.net/10138/585997
Full Text Finder 
Nájsť tento článok vo Web of Science