Efficient computation of shortest absent words in a genomic sequence (Q765489): Difference between revisions
From MaRDI portal
Created a new 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006514054 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3138909 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Distribution of the Number of Missing Words in Random Texts / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:54, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of shortest absent words in a genomic sequence |
scientific article |
Statements
Efficient computation of shortest absent words in a genomic sequence (English)
0 references
19 March 2012
0 references
sequence analysis
0 references
absent words
0 references
shortest absent words
0 references
algorithms on sequences
0 references
