How to resolve the algorithm FASTA format step by step in the 11l programming language

Published on 12 May 2024 09:40 PM
#11l

How to resolve the algorithm FASTA format step by step in the 11l programming language

Table of Contents

Problem Statement

In bioinformatics, long character strings are often encoded in a format called FASTA.
A FASTA file can contain several strings, each identified by a name marked by a > (greater than) character at the beginning of the line.

Write a program that reads a FASTA file such as: Note that a high-quality implementation will not hold the entire file in memory at once; real FASTA files can be multiple gigabytes in size.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm FASTA format step by step in the 11l programming language

Source code in the 11l programming language

V FASTA =
|‘>Rosetta_Example_1
  THERECANBENOSPACE
  >Rosetta_Example_2
  THERECANBESEVERAL
  LINESBUTTHEYALLMUST
  BECONCATENATED’

F fasta_parse(infile_str)
   V key = ‘’
   V val = ‘’
   [(String, String)] r
   L(line) infile_str.split("\n")
      I line.starts_with(‘>’)
         I key != ‘’
            r [+]= (key, val)
         key = line[1..].split_py()[0]
         val = ‘’
      E I key != ‘’
         val ‘’= line
   I key != ‘’
      r [+]= (key, val)
   R r

print(fasta_parse(FASTA).map((key, val) -> ‘#.: #.’.format(key, val)).join("\n"))

You may also check:How to resolve the algorithm Nth root step by step in the Logo programming language
You may also check:How to resolve the algorithm Hofstadter Q sequence step by step in the R programming language
You may also check:How to resolve the algorithm Day of the week step by step in the jq programming language
You may also check:How to resolve the algorithm Sort disjoint sublist step by step in the MiniScript programming language
You may also check:How to resolve the algorithm Date manipulation step by step in the PL/I programming language