Suchergebnisse - (((("string algorithm") OR ("spring algorithm"))) OR ("springer algorithm"))

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

Autoren: Xiaoya Hu

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

Schlagwörter: Electrical engineering. Electronics. Nuclear engineering, Enhanced search spring algorithm, optimization, efficient management, supply chain, green agricultural supply chain network, agriculture, TK1-9971

Zugangs-URL: https://doaj.org/article/05a1a8c1fb3c4a22a4d5590a161fe335

On String and Graph Sanitization

Autoren: Bernardini G. Chen H. Loukides G. et al.

Weitere Verfasser: Bernardini G. Chen H. Loukides G. et al.

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/2434/1182276
https://doi.org/10.4230/OASIcs.Grossi.9

When Is String Reconstruction Using de Bruijn Graphs Hard?

Autoren: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. et al.

Weitere Verfasser: Bals, Ben van Krieken, Sebastiaan Pissis, Solon P. et al.

Schlagwörter: string algorithm, graph algorithm, de Bruijn graph, Eulerian trail

Dateibeschreibung: 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

Verfügbarkeit: 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

Autoren: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz et al.

Weitere Verfasser: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz et al.

Schlagwörter: string algorithm, k-mismatch square, parameterized square, order-preserving square, maximum gapped repeat

Dateibeschreibung: 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

Verfügbarkeit: 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

Autoren: Akram, Waseem Mieno, Takuya Waseem Akram and Takuya Mieno

Weitere Verfasser: Akram, Waseem Mieno, Takuya Waseem Akram and Takuya Mieno

Schlagwörter: string algorithm, consecutive occurrences, suffix tree

Dateibeschreibung: 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

Verfügbarkeit: 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

Missing value replacement in strings and applications

Autoren: Bernardini, Giulia Liu, Chang Loukides, Grigorios et al.

Weitere Verfasser: Bernardini, Giulia Liu, Chang Loukides, Grigorios et al.

Schlagwörter: 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

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

Shortest Undirected Paths in de Bruijn Graphs

Autoren: Zuba, Wiktor Lachish, Oded Pissis, Solon P. et al.

Weitere Verfasser: Zuba, Wiktor Lachish, Oded Pissis, Solon P. et al.

Quelle: Zuba , W , Lachish , O & Pissis , S P 2025 , Shortest Undirected Paths in de Bruijn Graphs . in P Bonizzoni & V Makinen (eds) , 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025) : [Proceedings] . , 12 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 331 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , pp. 1-13 , 36th Annual Symposium on Combinatorial Pattern Matching, CPM 2025 , Milan , Italy , 17/06/25 . https://doi.org/10.4230/LIPIcs.CPM.2025.12

Schlagwörter: de Bruijn graph, Eulerian graph, graph algorithm, string algorithm

Relation: urn:ISBN:9783959773690

Verfügbarkeit: https://research.vu.nl/en/publications/fe7c74be-39b3-4e1e-b2f8-8c6854c7c428
https://doi.org/10.4230/LIPIcs.CPM.2025.12
https://hdl.handle.net/1871.1/fe7c74be-39b3-4e1e-b2f8-8c6854c7c428
http://www.scopus.com/inward/record.url?scp=105008312285&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=105008312285&partnerID=8YFLogxK
https://drops.dagstuhl.de/entities/volume/LIPIcs-volume-331

Elastic-Degenerate String Matching with 1 Error or Mismatch

Autoren: Bernardini, Giulia Gabory, Esteban Pissis, Solon et al.

Weitere Verfasser: Bernardini, Giulia Gabory, Esteban Pissis, Solon et al.

Quelle: Theory of Computing Systems

Schlagwörter: 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]

Dateibeschreibung: application/pdf

Zugangs-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

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

Autoren: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz et al.

Weitere Verfasser: Nakashima, Yuto Radoszewski, Jakub Waleń, Tomasz et al.

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2509.02179
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.8

Connecting de Bruijn Graphs

Autoren: Bernardini G. Chen H. Gortz I. L. et al.

Weitere Verfasser: Bernardini G. Chen H. Gortz I. L. et al.

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/2434/1131455
https://doi.org/10.4230/LIPIcs.CPM.2024.6

Shortest Cover After Edit

Autoren: Mitani, Kazuki Mieno, Takuya Seto, Kazuhisa et al.

Weitere Verfasser: Mitani, Kazuki Mieno, Takuya Seto, Kazuhisa et al.

Schlagwörter: string algorithm, border, cover, quasi-periodicity, dynamic string

Dateibeschreibung: 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

Verfügbarkeit: 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

Autoren: Giulia Bernardini Gabriele Fici Paweł Gawrychowski et al.

Weitere Verfasser: Giulia Bernardini Gabriele Fici Paweł Gawrychowski et al.

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/2434/1131463
https://doi.org/10.4230/lipics.isaac.2023.12

A Simple Heuristic for Order-Preserving Matching

Autoren: Inbok LEE Joong Chae NA

Quelle: IEICE Transactions on Information and Systems. 2019, E102.D(3):502

A Heuristic for Constructing Smaller Automata Based on Suffix Sorting and Its Application in Network Security

Autoren: Inbok LEE Min S. KIM Sung-il OH et al.

Quelle: IEICE Transactions on Information and Systems. 2018, E101.D(3):613

Capturing Local Material Heterogeneities in Numerical Modelling of Microstructure Evolution

Autoren: Lukasz Madej Mateusz Sitko Aleksander Fular et al.

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

Schlagwörter: microstructure, cellular automata, finite element method, spring algorithm, Mechanical engineering and machinery, TJ1-1570

Dateibeschreibung: 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

Zugangs-URL: https://doaj.org/article/277efb2f019b4517982fdb5f4b447fdf

Using the longest run subsequence problem within homology-based scaffolding

Autoren: Sven Schrinner Manish Goel Michael Wulfert et al.

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

Schlagwörter: Alignment, Assembly, String algorithm, Longest subsequence, Biology (General), QH301-705.5, Genetics, QH426-470

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/4603bc53f7e9405499ebea0f664c4cd7

Parallel Suffix Sorting for Large String Analytics

Autoren: Du, Zhihui Zhang, Sen Bader, David A.

Quelle: Faculty Publications

Schlagwörter: Optimal Algorithm, Parallel Sorting, String Algorithm, String Analysis, Suffix Array

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

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

Solving String Problems on Graphs Using the Labeled Direct Product

Autoren: Nicola Rizzo Alexandru I. Tomescu Alberto Policriti et al.

Weitere Verfasser: Nicola Rizzo Alexandru I. Tomescu Alberto Policriti et al.

Quelle: Algorithmica

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10138/349646

On Strings Having the Same Length- k Substrings

Autoren: Giulia Bernardini Alessio Conte Esteban Gabory et al.

Weitere Verfasser: Giulia Bernardini Alessio Conte Esteban Gabory et al.

Schlagwörter: 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/

Verfügbarkeit: 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

Autoren: Giulia Bernardini Huiping Chen Grigorios Loukides et al.

Weitere Verfasser: Giulia Bernardini Huiping Chen Grigorios Loukides et al.

Schlagwörter: 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

Verfügbarkeit: 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