(Q56485241)

English

Replacing suffix trees with enhanced suffix arrays

No description defined

In more languages

default for all languages

No label defined

No description defined

edit

Statements

instance of

scholarly article

0 references

title

Replacing suffix trees with enhanced suffix arrays (English)

0 references

1 reference

Mohamed Ibrahim Abouelhoda

series ordinal

0 references

author name string

Stefan Kurtz

series ordinal

0 references

Enno Ohlebusch

series ordinal

0 references

publication date

March 2004

0 references

published in

Journal of Discrete Algorithms

0 references

volume

0 references

issue

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)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q56485241&oldid=2067946720"