Next Article in Journal
Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms 2014, 7, 166–185
Previous Article in Journal
Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts
Previous Article in Special Issue
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems
Algorithms 2014, 7(1), 186-187; doi:10.3390/a7010186
Editorial

Editorial: Special Issue on Algorithms for Sequence Analysis and Storage

Helsinki Institute for Information Technology HIIT, Department of Computer Science, P. O. Box 68 (Gustaf Hällströmin katu 2b), University of Helsinki, Helsinki 00014, Finland
Received: 14 March 2014 / Revised: 19 March 2014 / Accepted: 19 March 2014 / Published: 25 March 2014
(This article belongs to the Special Issue Algorithms for Sequence Analysis and Storage)
View Full-Text   |   Download PDF [71 KB, uploaded 25 March 2014]
SciFeed

Abstract

This special issue of Algorithms is dedicated to approaches to biological sequence analysis that have algorithmic novelty and potential for fundamental impact in methods used for genome research.
Keywords: high-throughput sequencing; compressed index structures; pattern discovery; population simulation; dynamic programming high-throughput sequencing; compressed index structures; pattern discovery; population simulation; dynamic programming
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
RIS
MDPI and ACS Style

Mäkinen, V. Editorial: Special Issue on Algorithms for Sequence Analysis and Storage. Algorithms 2014, 7, 186-187.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert