Analysis of the average depth in a suffix tree under a Markov model

Julien Fayolle, Mark Daniel Ward

Open source

DOI
10.46298/dmtcs.3371
Published
2005-01-01
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.3371,
  title = {Analysis of the average depth in a suffix tree under a Markov model},
  author = {Julien Fayolle and Mark Daniel Ward},
  year = {2005},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.3371},
  url = {https://doi.org/10.46298/dmtcs.3371}
}

RIS

TY  - JOUR
TI  - Analysis of the average depth in a suffix tree under a Markov model
AU  - Julien Fayolle
AU  - Mark Daniel Ward
PY  - 2005
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.3371
UR  - https://doi.org/10.46298/dmtcs.3371
ER  - 

APA

Fayolle, J., & Ward, M. D. (2005). Analysis of the average depth in a suffix tree under a Markov model. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.3371

Source records