/*! @mainpage Home SeqAn is an open source C++ library of efficient algorithms and data structures for the analysis of sequences with the focus on biological data. Our library applies a unique generic design that guarantees high performance, generality, extensibility, and integration with other libraries. SeqAn is easy to use and simplifies the development of new software tools with a minimal loss of performance. @section Getting Started

1. Install SeqAn. It's as easy as following the installation instructions.
2. Learn SeqAn. The SeqAn Tutorials in the SeqAn Manual will introduce you into SeqAn's basic concepts and show you how to use its data structures and functions.
3. Think SeqAn. Since our library uses advanced C++ template programming techniques, we recommend you to read our glossary of language entity types for a quick introduction.
4. Use SeqAn. Search the library for classes, functions, etc. using the search bar to the left. Need some orientation? Check the typical tasks below.

## Typical Tasks

If you know what you want to do but not how to achieve this with SeqAn, this sections gives you a nice overview of the components that might help you. Alternatively you might want to check the SeqAn Tutorials.

- ### File I/O

  SeqAn has support for most common file formats in Bioinformatics. The following lists the most convenient access methods.

  I/O Overview | instructive introductions
  @link SeqFileIn @endlink @link SeqFileOut @endlink @link FaiIndex @endlink | FASTA, FASTQ
  @link BamFileIn @endlink @link BamFileOut @endlink | SAM, BAM
  @link VcfFileIn @endlink @link VcfFileOut @endlink | VCF
  @link BedFileIn @endlink @link BedFileOut @endlink | BED
  @link GffFileIn @endlink @link GffFileOut @endlink | GFF, GTF

- ### Sequence Alignment and Multiple Sequence Alignment

  Sequence alignment and multiple sequence alignment are classic problems in Bioinformatics.

  Alignment Representation Pairwise Sequence Alignment Multiple Sequence Alignment | instructive introductions
  @link globalAlignment @endlink | provides dynamic programming algorithms for global sequence alignment with various parameters
  @link localAlignment @endlink |
  @link LocalAlignmentEnumerator @endlink | offers the Waterman-Eggert algorithm for enumerating suboptimal local alignments
  @link Align @endlink | provides a data structure for tabular alignment of sequences with the same type
  @link Gaps @endlink | allows one to store gaps independent of the underlying sequence

- ### Graph Data Structures and Algorithms

  Often, graphs come in handy to model subproblems in sequence analysis. SeqAn provides basic support for graphs and graph algorithms.

  Graphs | instructive introductions
  @link Graph @endlink | central class (including subclasses)
  @link DirectedGraph @endlink @link UndirectedGraph @endlink. | simple directed and undirected graphs structures
  @link Automaton @endlink @link WordGraph @endlink @link HmmGraph @endlink | special subclasses for sequence analysis
  @link dijkstra Dijkstra's algorithm @endlink @link bellmanFordAlgorithm Bellman-Ford algorithm @endlink @link topologicalSort topological sorting @endlink @link dagShortestPath shortest paths in DAGs @endlink | standard graph algorithms
  For more advanced usage and algorithms, we recommend using the LEMON Graph Library.

*/