Skip to main navigation Skip to search Skip to main content

Fast exact algorithms for the closest string and substring problems with application to the planted (L,d)-motif model

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

28   Link opens in a new tab Citations (Scopus)

Fingerprint

Dive into the research topics of 'Fast exact algorithms for the closest string and substring problems with application to the planted (L,d)-motif model'. Together they form a unique fingerprint.
Sort by

Mathematics