Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q56485241)
Watch
English
Replacing suffix trees with enhanced suffix arrays
No description defined
In more languages
edit
Statements
instance of
scholarly article
0 references
title
Replacing suffix trees with enhanced suffix arrays
(English)
0 references
main subject
suffix array
1 reference
based on heuristic
inferred from title
author
Mohamed Abouelhoda
object named as
Mohamed Ibrahim Abouelhoda
series ordinal
1
0 references
author name string
Stefan Kurtz
series ordinal
2
0 references
Enno Ohlebusch
series ordinal
3
0 references
publication date
March 2004
0 references
published in
Journal of Discrete Algorithms
0 references
volume
2
0 references
issue
1
0 references
page(s)
53-86
0 references
maintained by WikiProject
WikiProject Mathematics
0 references
cites work
Alignment of whole genomes
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Fast algorithms for large-scale genome alignment and comparison
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Efficient multiple genome alignment.
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Reducing the space requirement of suffix trees
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
REPuter: the manifold applications of repeat analysis on a genomic scale
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Initial sequencing and analysis of the human genome
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Suffix Arrays: A New Method for On-Line String Searches
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
A universal algorithm for sequential data compression
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Compression of individual sequences via variable-rate coding
1 reference
stated in
Crossref
reference URL
https://api.crossref.org/works/10.1016%2FS1570-8667%2803%2900065-0
retrieved
7 January 2021
based on heuristic
inferred from DOI database lookup
Identifiers
DOI
10.1016/S1570-8667(03)00065-0
0 references
DBLP publication ID
journals/jda/AbouelhodaKO04
1 reference
stated in
DBLP Dataset 2021-01-02
retrieved
28 January 2021
zbMATH Open document ID
1115.92303
0 references
Sitelinks
Wikipedia
(0 entries)
edit
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit
