45 breaking releases

0.46.0 Dec 12, 2024
0.45.0 Oct 22, 2024
0.44.0 Sep 26, 2024
0.41.0 Jul 14, 2024
0.2.0 Jul 30, 2021

#1442 in Parser implementations

Download history 589/week @ 2024-09-11 510/week @ 2024-09-18 699/week @ 2024-09-25 767/week @ 2024-10-02 1675/week @ 2024-10-09 983/week @ 2024-10-16 954/week @ 2024-10-23 880/week @ 2024-10-30 744/week @ 2024-11-06 439/week @ 2024-11-13 904/week @ 2024-11-20 835/week @ 2024-11-27 741/week @ 2024-12-04 1103/week @ 2024-12-11 915/week @ 2024-12-18 363/week @ 2024-12-25

3,356 downloads per month
Used in 58 crates (6 directly)

MIT license

250KB
5.5K SLoC

noodles-fasta handles and reading and writing of the FASTA format.

FASTA is a text format with no formal specification and only has de facto rules. It typically consists of a list of records, each with a definition on the first line and a sequence in the following lines.

The definition starts with a > (greater than) character, and directly after it is the reference sequence name. Optionally, whitespace may be used a delimiter for an extra description or metadata of the sequence. For example,

 reference sequence name
 | |
>sq0 LN:13
     |   |
     description

The sequence is effectively a byte array of characters representing a base. It is typically hard wrapped at an arbitrary width. For example, the following makes up the sequence ACGTNACTGG.

ACGT
NACT
GG

Examples

Read all records in a FASTA file

use noodles_fasta as fasta;

let mut reader = File::open("reference.fa")
    .map(BufReader::new)
    .map(fasta::io::Reader::new)?;

for result in reader.records() {
    let record = result?;
    // ...
}

Dependencies

~1.4–7MB
~50K SLoC