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

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

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

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

Elastic-Degenerate String Matching via Fast Matrix Multiplication

Autoři: Bernardini G. Gawrychowski P. Pisanti N. a další

Přispěvatelé: Bernardini G. Gawrychowski P. Pisanti N. a další

Zdroj: SIAM Journal on Computing
NARCIS
Hyper Article en Ligne
Datacite
ORCID
INRIA a CCSD electronic archive server
arXiv.org e-Print Archive
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S P & Rosone, G 2022, ' ELASTIC-DEGENERATE STRING MATCHING VIA FAST MATRIX MULTIPLICATION ', SIAM Journal on Computing, vol. 51, no. 3, pp. 549-576 . https://doi.org/10.1137/20M1368033
SIAM Journal on Computing, 2022, 51 (3), pp.549-576. ⟨10.1137/20M1368033⟩
SIAM Journal on Computing, 51(3), 549-576
SIAM Journal on Computing, 51(3), 549-576. Society for Industrial and Applied Mathematics Publications

Témata: FOS: Computer and information sciences, 0301 basic medicine, General Computer Science, string algorithms, pattern matching, elastic-degenerate string, matrix multiplication, fast Fourier transform, General Mathematics, 0102 computer and information sciences, [INFO] Computer Science [cs], string algorithm, 01 natural sciences, 03 medical and health sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1905.02298
https://epubs.siam.org/doi/10.1137/20M1368033
https://hdl.handle.net/11368/3020913
https://research.vu.nl/en/publications/1e4fd0c7-96a9-47e8-8dcf-eb4e81d17364
https://doi.org/10.1137/20M1368033
https://hdl.handle.net/1871.1/1e4fd0c7-96a9-47e8-8dcf-eb4e81d17364
https://inria.hal.science/hal-03676475v1/document
https://inria.hal.science/hal-03676475v1
https://doi.org/10.1137/20m1368033
https://epubs.siam.org/doi/10.1137/20M1368033
https://hdl.handle.net/11368/3020913
https://doi.org/10.1137/20M1368033
https://hdl.handle.net/11568/1149767
https://epubs.siam.org/doi/10.1137/20M1368033
https://doi.org/10.1137/20M1368033
https://hal.inria.fr/hal-03676475/document
https://research.vu.nl/en/publications/1e4fd0c7-96a9-47e8-8dcf-eb4e81d17364
https://hal.inria.fr/hal-03676475
https://doi.org/10.48550/arxiv.1905.02298
https://ir.cwi.nl/pub/32732
https://doi.org/10.1137/20m1368033
http://arxiv.org/abs/1905.02298

Capturing Local Material Heterogeneities in Numerical Modelling of Microstructure Evolution

Autoři: Lukasz Madej Mateusz Sitko Aleksander Fular a další

Zdroj: Journal of Machine Engineering, Vol 21, Iss 4, Pp 29-48 (2021)

Témata: microstructure, cellular automata, finite element method, spring algorithm, Mechanical engineering and machinery, TJ1-1570

Popis souboru: electronic resource

Relation: http://jmacheng.not.pl/Capturing-Local-Material-Heterogeneities-in-Numerical-Modelling-of-Microstructure,143086,0,2.html; https://doaj.org/toc/1895-7595; https://doaj.org/toc/2391-8071

Přístupová URL adresa: https://doaj.org/article/277efb2f019b4517982fdb5f4b447fdf

Using the longest run subsequence problem within homology-based scaffolding

Autoři: Sven Schrinner Manish Goel Michael Wulfert a další

Zdroj: Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-11 (2021)

Témata: Alignment, Assembly, String algorithm, Longest subsequence, Biology (General), QH301-705.5, Genetics, QH426-470

Popis souboru: electronic resource

Relation: https://doaj.org/toc/1748-7188

Přístupová URL adresa: https://doaj.org/article/4603bc53f7e9405499ebea0f664c4cd7

Parallel Suffix Sorting for Large String Analytics

Autoři: Du, Zhihui Zhang, Sen Bader, David A.

Zdroj: Faculty Publications

Témata: Optimal Algorithm, Parallel Sorting, String Algorithm, String Analysis, Suffix Array

Relation: https://digitalcommons.njit.edu/fac_pubs/2078

Dostupnost: https://digitalcommons.njit.edu/fac_pubs/2078
https://doi.org/10.1007/978-3-031-30442-2_6

On Strings Having the Same Length- k Substrings

Autoři: Giulia Bernardini Alessio Conte Esteban Gabory a další

Přispěvatelé: Giulia Bernardini Alessio Conte Esteban Gabory a další

Témata: string algorithm, combinatorics on word, de Bruijn graph, Chinese Postman

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-234-1; 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022); volume:223; firstpage:16:1; lastpage:16:17; numberofpages:17; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; info:eu-repo/grantAgreement/EC/H2020/872539; 956229; https://hdl.handle.net/11368/3024591; https://drops.dagstuhl.de/opus/volltexte/2022/16140/

Dostupnost: https://hdl.handle.net/11368/3024591
https://doi.org/10.4230/lipics.cpm.2022.16
https://drops.dagstuhl.de/opus/volltexte/2022/16140/

Making de Bruijn Graphs Eulerian

Autoři: Giulia Bernardini Huiping Chen Grigorios Loukides a další

Přispěvatelé: Giulia Bernardini Huiping Chen Grigorios Loukides a další

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

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-234-1; 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022); volume:223; firstpage:12:1; lastpage:12:18; numberofpages:18; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/11368/3024593; https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=16139

Dostupnost: https://hdl.handle.net/11368/3024593
https://doi.org/10.4230/lipics.cpm.2022.12
https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=16139

Elastic-Degenerate String Matching with 1 Error

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

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

Témata: String algorithm, Approximate string matching, Edit distance, Degenerate string, Elastic-degenerate strings

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-031-20623-8; info:eu-repo/semantics/altIdentifier/isbn/978-3-031-20624-5; info:eu-repo/semantics/altIdentifier/wos/WOS:001416662300002; ispartofbook:LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings; Latin American Symposium on Theoretical Informatics; volume:13568; firstpage:20; lastpage:37; numberofpages:18; serie:LECTURE NOTES IN ARTIFICIAL INTELLIGENCE; info:eu-repo/grantAgreement/EC/H2020/956229; https://hdl.handle.net/11368/3032860

Dostupnost: https://hdl.handle.net/11368/3032860
https://doi.org/10.1007/978-3-031-20624-5_2