Linear time construction of indexable elastic founder graphs (Q2169983): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4285151990 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5091210 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line construction of suffix trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear time construction of indexable founder block graphs / rank | |||
Normal rank | |||
Latest revision as of 12:29, 4 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear time construction of indexable elastic founder graphs |
scientific article |
Statements
Linear time construction of indexable elastic founder graphs (English)
0 references
30 August 2022
0 references
multiple sequence alignment
0 references
pattern matching
0 references
data structures
0 references
segmentation algorithms
0 references
dynamic programming
0 references
suffix tree
0 references
0 references
