47 releases (breaking)

0.38.0 May 16, 2024
0.36.0 May 2, 2024
0.35.0 Mar 28, 2024
0.31.0 Dec 14, 2023
0.2.0 Jul 30, 2021

#1400 in Parser implementations

Download history 783/week @ 2024-02-02 501/week @ 2024-02-09 801/week @ 2024-02-16 888/week @ 2024-02-23 811/week @ 2024-03-01 919/week @ 2024-03-08 676/week @ 2024-03-15 565/week @ 2024-03-22 681/week @ 2024-03-29 510/week @ 2024-04-05 733/week @ 2024-04-12 714/week @ 2024-04-19 508/week @ 2024-04-26 632/week @ 2024-05-03 758/week @ 2024-05-10 964/week @ 2024-05-17

2,916 downloads per month
Used in 48 crates (7 directly)

MIT license

230KB
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::Reader::new)?;

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

Dependencies

~1.4–3MB
~51K SLoC