The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On approximate string matching of unique oligonucleotides

På svenska

Author

Summary, in English

The current research considers the approximate string matching search for important subsequences from DNA sequences, which is essential for numerous bioinformatics computation tasks. We tested several approximate string matching algorithms and furthermore developed one for DNA data. Run times of the algorithms are important, since the amount of data is very large.

Publishing year

2001

Language

English

Pages

960-964

Publication/Series

MEDINFO 2001: PROCEEDINGS OF THE 10TH WORLD CONGRESS ON MEDICAL INFORMATICS, PTS 1 AND 2

Volume

84

Document type

Conference paper

Publisher

I O S Press

Topic

  • Medical Genetics

Keywords

  • approximate string matching
  • DNA
  • oligonucleotides

Conference name

10th World Congress on Medical Informatics (MEDINFO 2001)

Conference date

0001-01-02

Status

Published

ISBN/ISSN/Other

  • ISSN: 0926-9630