"Fast algorithms for computing sequence distances by exhaustive substring ..."

Alberto Apostolico, Olgert Denas (2008)

> Home

Details and statistics

DOI: 10.1186/1748-7188-3-13

access: open

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/almob/ApostolicoD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/almob/ApostolicoD08
Alberto Apostolico, Olgert Denas:
Fast algorithms for computing sequence distances by exhaustive substring composition. Algorithms Mol. Biol. 3 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.