Výsledky vyhledávání - (("string algorithm") OR ("spring algorithm"))~

Enhanced Search Spring Algorithm for Green Agri-Food Supply Chain Network Design

Autoři: Xiaoya Hu

Zdroj: IEEE Access, Vol 13, Pp 109034-109045 (2025)

Témata: Electrical engineering. Electronics. Nuclear engineering, Enhanced search spring algorithm, optimization, efficient management, supply chain, green agricultural supply chain network, agriculture, TK1-9971

Přístupová URL adresa: https://doaj.org/article/05a1a8c1fb3c4a22a4d5590a161fe335

Catanduanes State University Employee Profiling Management System Implementing Knuth-Morris-Pratt Search String Algorithm

Autoři: Ramona Michelle M. Magtangob Maria Concepcion S. Vera

Zdroj: 2024 International Conference on Advances in Computing, Communication, Electrical, and Smart Systems (iCACCESS). :1-6

Optimal Network Reconfiguration considering Weighted Sum Multiobjective Cuckoo Search Spring Algorithm

Autoři: Z. Mohamad Izwan Z. Zuhaina Z. M. Yasin

Zdroj: Journal of Electrical & Electronic Systems Research. 21:114-120

On String and Graph Sanitization

Autoři: Bernardini G. Chen H. Loukides G. a další

Přispěvatelé: Bernardini G. Chen H. Loukides G. a další

Témata: data privacy, data sanitization, graph algorithm, string algorithm, Settore INFO-01/A - Informatica, Settore IINF-05/A - Sistemi di elaborazione delle informazioni

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-391-1; ispartofbook:From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday (Grossi's Festschrift); From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025; volume:132; firstpage:1; lastpage:10; numberofpages:10; serie:OPEN ACCESS SERIES IN INFORMATICS; alleditors:A. Conte, A. Marino, G. Rosone, J. Scott Vitte; https://hdl.handle.net/2434/1182276

Dostupnost: https://hdl.handle.net/2434/1182276
https://doi.org/10.4230/OASIcs.Grossi.9

When Is String Reconstruction Using de Bruijn Graphs Hard?

Autoři: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. a další

Přispěvatelé: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. a další

Témata: string algorithm, graph algorithm, de Bruijn graph, Eulerian trail

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.53

Dostupnost: https://doi.org/10.4230/LIPIcs.ESA.2025.53
https://nbn-resolving.org/urn:nbn:de:0030-drops-245215
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.53

Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares

Autoři: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz a další

Přispěvatelé: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz a další

Témata: string algorithm, k-mismatch square, parameterized square, order-preserving square, maximum gapped repeat

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.8

Dostupnost: https://doi.org/10.4230/LIPIcs.ESA.2025.8
https://nbn-resolving.org/urn:nbn:de:0030-drops-244768
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.8

Sorted Consecutive Occurrence Queries in Substrings

Autoři: Akram, Waseem Mieno, Takuya Waseem Akram and Takuya Mieno

Přispěvatelé: Akram, Waseem Mieno, Takuya Waseem Akram and Takuya Mieno

Témata: string algorithm, consecutive occurrences, suffix tree

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 331, 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.24

Dostupnost: https://doi.org/10.4230/LIPIcs.CPM.2025.24
https://nbn-resolving.org/urn:nbn:de:0030-drops-231187
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.24

Elastic-Degenerate String Matching with 1 Error or Mismatch

Autoři: Bernardini, Giulia Gabory, Esteban Pissis, Solon a další

Přispěvatelé: Bernardini, Giulia Gabory, Esteban Pissis, Solon a další

Zdroj: Theory of Computing Systems

Témata: 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]

Popis souboru: application/pdf

Přístupová URL adresa: 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

Fast Computation of $k$-Runs, Parameterized Squares, and Other Generalised Squares

Autoři: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz a další

Přispěvatelé: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz a další

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, parameterized square, maximum gapped repeat, order-preserving square, Data Structures and Algorithms (cs.DS), ddc:004, string algorithm, k-mismatch square

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2509.02179
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.8

Shortest Undirected Paths in de Bruijn Graphs

Autoři: Zuba, Wiktor Lachish, Oded Pissis, Solon P. a další

Přispěvatelé: Zuba, Wiktor Lachish, Oded Pissis, Solon P. a další

Témata: graph algorithm, ddc:004, string algorithm, Eulerian graph, de Bruijn graph

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.12

Missing value replacement in strings and applications

Autoři: Bernardini, Giulia Liu, Chang Loukides, Grigorios a další

Přispěvatelé: Bernardini, Giulia Liu, Chang Loukides, Grigorios a další

Témata: string algorithm, forbidden pattern, missing value replacement, string sanitization, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001402119200001; volume:39; issue:2; firstpage:1; lastpage:50; numberofpages:50; journal:DATA MINING AND KNOWLEDGE DISCOVERY; https://hdl.handle.net/2434/1138695

Dostupnost: https://hdl.handle.net/2434/1138695
https://doi.org/10.1007/s10618-024-01074-3

Chapman-Kolmogorov Relation Based Median String Algorithm for DNA Consensus Classification

Autoři: Mohammad Ibrahim Khan Mohammad Shibli Kaysar

Zdroj: 2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT). :1-6

Témata: 0301 basic medicine, 03 medical and health sciences, 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://xplorestaging.ieee.org/ielx7/8931128/8934442/08934582.pdf?arnumber=8934582
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=8934582

Application Of The Levenshtein String Algorithm In A Web-Based Correspondence System Atbregional Publik Companies (Tirta Hidayah Bengkulu City)

Autoři: Marhalim Marhalim Yuza Reswan Khairullah Khairullah a další

Zdroj: Jurnal Komputer, Informasi dan Teknologi. 2

Connecting de Bruijn Graphs

Autoři: Bernardini G. Chen H. Gortz I. L. a další

Přispěvatelé: Bernardini G. Chen H. Gortz I. L. a další

Témata: de Bruijn graph, Eulerian graph, graph algorithm, string algorithm, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783959773263; ispartofbook:35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024); Annual Symposium on Combinatorial Pattern Matching, CPM 2024; volume:296; firstpage:1; lastpage:16; numberofpages:16; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; alleditors:S. Inenaga, S.J. Puglisi; https://hdl.handle.net/2434/1131455

Dostupnost: https://hdl.handle.net/2434/1131455
https://doi.org/10.4230/LIPIcs.CPM.2024.6

Shortest Cover After Edit

Autoři: Mitani, Kazuki Mieno, Takuya Seto, Kazuhisa a další

Přispěvatelé: Mitani, Kazuki Mieno, Takuya Seto, Kazuhisa a další

Témata: string algorithm, border, cover, quasi-periodicity, dynamic string

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 296, 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.24

Dostupnost: https://doi.org/10.4230/LIPIcs.CPM.2024.24
https://nbn-resolving.org/urn:nbn:de:0030-drops-201345
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.24

Substring Complexity in Sublinear Space

Autoři: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a další

Přispěvatelé: Giulia Bernardini Gabriele Fici Paweł Gawrychowski a další

Témata: string algorithm, sublinear-space algorithm, substring complexity, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001556429800012; ispartofbook:34th International Symposium on Algorithms and Computation (ISAAC 2023); International Symposium on Algorithms and Computation, ISAAC 2023; volume:283; firstpage:1; lastpage:19; numberofpages:19; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/2434/1131463

Dostupnost: https://hdl.handle.net/2434/1131463
https://doi.org/10.4230/lipics.isaac.2023.12

Lasso-Path and Taut String Algorithm for One-Dimensional Total Variation Regularization

Autoři: Hagen, Lene Grasmair, Markus

Přispěvatelé: Hagen, Lene Grasmair, Markus

Dostupnost: http://hdl.handle.net/11250/2459271

A 'taut string algorithm' for straightening a piecewise linear path in two dimensions: A `taut-string algorithm' for straightening a piecewise linear path in two dimensions

Autoři: M. J. D. Powell

Zdroj: IMA Journal of Numerical Analysis. 18:1-35

Témata: taut-string algorithm, minimization algorithm, Computer-aided design (modeling of curves and surfaces), numerical examples, iterative algorithm, convergence, 0202 electrical engineering, electronic engineering, information engineering, piecewise linear path, straightening, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1180321
https://doi.org/10.1093/imanum/18.1.1
http://academic.oup.com/imajna/article-abstract/18/1/1/679082
https://academic.oup.com/imajna/article-abstract/18/1/1/679082

Solving String Problems on Graphs Using the Labeled Direct Product

Autoři: Nicola Rizzo Alexandru I. Tomescu Alberto Policriti a další

Přispěvatelé: Nicola Rizzo Alexandru I. Tomescu Alberto Policriti a další

Zdroj: Algorithmica

Témata: FINITE AUTOMATA, COMPLEXITY, Computer and information sciences, Fine-grained complexity, 0206 medical engineering, Graph algorithm, SUFFIX TREE, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Longest common substring, String algorithm, AMBIGUITY, Longest repeated substring, Motif discovery

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10138/349646

GPU-Accelerated Query by Humming Using Modified SPRING Algorithm

Autoři: Zhenzhong Zhang Li Ruan Yao Zheng a další

Zdroj: 2013 IEEE 13th International Conference on Data Mining Workshops. :654-663

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://www.computer.org/csdl/proceedings-article/icdmw/2013/3143a654/12OmNz4SOy4
https://ieeexplore.ieee.org/document/6753982/
https://dblp.uni-trier.de/db/conf/icdm/icdmw2013.html#YaoZXRLZ13
http://ieeexplore.ieee.org/document/6753982/