47 breaking releases

new 0.48.0 Jan 24, 2025
0.46.0 Dec 12, 2024
0.45.0 Oct 22, 2024
0.41.0 Jul 14, 2024
0.2.0 Jul 30, 2021

#1083 in Parser implementations

Download history 1291/week @ 2024-10-06 1285/week @ 2024-10-13 962/week @ 2024-10-20 845/week @ 2024-10-27 757/week @ 2024-11-03 615/week @ 2024-11-10 599/week @ 2024-11-17 926/week @ 2024-11-24 782/week @ 2024-12-01 1093/week @ 2024-12-08 1161/week @ 2024-12-15 397/week @ 2024-12-22 491/week @ 2024-12-29 1424/week @ 2025-01-05 1707/week @ 2025-01-12 1592/week @ 2025-01-19

5,233 downloads per month
Used in 62 crates (6 directly)

MIT license

265KB
6K 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–7.5MB
~50K SLoC