抱狗不敢前 发表于 2025-3-26 22:41:14

KATKA: A KRAKEN-Like Tool with , Given at Query Timeroot of the smallest subtree of . containing all the genomes in which the .-mer . occurs, for .. This is similar to KRAKEN’s functionality but with . given at query time instead of at construction time.

丛林 发表于 2025-3-27 01:26:13

Conference proceedings 2022 Concepción, Chile, in November 2022..The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology..

凹处 发表于 2025-3-27 07:49:05

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/879708.jpg

不可侵犯 发表于 2025-3-27 11:42:52

https://doi.org/10.1007/978-3-031-20643-6adaptive algorithms; artificial intelligence; computer hardware; computer systems; computer vision; corre

集中营 发表于 2025-3-27 15:56:44

http://reply.papertrans.cn/88/8798/879708/879708_35.png

Pedagogy 发表于 2025-3-27 17:54:12

Maik Fröbe,Christopher Akiki,Martin Potthast,Matthias Hagenchtigsten Systeme in den Bereichen Umweltschutz, Qualität sowie Arbeitssicherheits- und Gesundheitsschutz sind den vorangegangenen Kapiteln zu entnehmen. Dort finden sich auch die Ziele, Aufgaben und Ausprägungen der einzelnen Teilsysteme. Vielfach entstanden im Zusammenhang mit der Einführung der M

吞没 发表于 2025-3-27 23:00:23

The Complexity of the Co-occurrence Problemme queries are optimal given optimal space. Secondly, we bound ., giving clean bounds in terms of . and . that match the state of the art. Furthermore, we prove that . bits of space is necessary in the worst case, meaning that the . upper bound is tight to within polylogarithmic factors. All of our

概观 发表于 2025-3-28 04:42:38

Sorting Genomes by Prefix Double-Cut-and-Joinse, the first sorting by . rearrangements problem that admits an approximation ratio strictly smaller than 2 (with the obvious exception of the polynomial-time solvable problems); and finally, (4) an . algorithm for sorting by unsigned prefix DCJs parameterised by the number of breakpoints in the gen

Maximize 发表于 2025-3-28 08:31:26

http://reply.papertrans.cn/88/8798/879708/879708_39.png

OATH 发表于 2025-3-28 11:37:16

http://reply.papertrans.cn/88/8798/879708/879708_40.png
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: String Processing and Information Retrieval; 29th International S Diego Arroyuelo,Barbara Poblete Conference proceedings 2022 The Editor(s)