Fast computation of a string duplication history under no-breakpoint-reuse.

Brejová B, Kravec M, Landau GM, Vinař T

Open source

DOI
10.1098/rsta.2013.0133
Published
2014 May 28
Container
Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/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.1098/rsta.2013.0133,
  title = {Fast computation of a string duplication history under no-breakpoint-reuse.},
  author = {Brejová B and Kravec M and Landau GM and Vinař T},
  year = {2014},
  journal = {Philosophical transactions. Series A, Mathematical, physical, and engineering sciences},
  doi = {10.1098/rsta.2013.0133},
  url = {https://doi.org/10.1098/rsta.2013.0133}
}

RIS

TY  - JOUR
TI  - Fast computation of a string duplication history under no-breakpoint-reuse.
AU  - Brejová B
AU  - Kravec M
AU  - Landau GM
AU  - Vinař T
PY  - 2014
JO  - Philosophical transactions. Series A, Mathematical, physical, and engineering sciences
DO  - 10.1098/rsta.2013.0133
UR  - https://doi.org/10.1098/rsta.2013.0133
ER  - 

APA

B, B., M, K., GM, L., & T, V. (2014). Fast computation of a string duplication history under no-breakpoint-reuse.. Philosophical transactions. Series A, Mathematical, physical, and engineering sciences. https://doi.org/10.1098/rsta.2013.0133

Source records