Longest common substrings with k mismatches

View Publication
Abstract:
No abstract specified

SEEK ID: https://publications.h-its.org/publications/86

SEEK ID: https://publications.h-its.org/publications/86

DOI: 10.1016/j.ipl.2015.03.006

Research Groups: Computational Molecular Evolution

Publication type: Journal

Journal: Information Processing Letters

Citation: Information Processing Letters 115(6-8):643-647

Date Published: 1st Jun 2015

Registered Mode: imported from a bibtex file

Authors: Tomas Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen

Citation
Flouri, T., Giaquinta, E., Kobert, K., & Ukkonen, E. (2015). Longest common substrings with k mismatches. In Information Processing Letters (Vol. 115, Issues 6-8, pp. 643–647). Elsevier BV. https://doi.org/10.1016/j.ipl.2015.03.006
Activity

Views: 5852

Created: 7th Sep 2019 at 07:10

Last updated: 5th Mar 2024 at 21:23

help Tags

This item has not yet been tagged.

help Attributions

None

Powered by
 (v.1.14.2)
About HITS Publication SEEK | About HITS-Publication-SEEK | Funding and Programmes | Credits
Copyright © 2008 - 2023 The University of Manchester and HITS gGmbH