A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://github.com/hsinnan75/DART below:

hsinnan75/Dart: DART – a fast and accurate RNA-seq mapper with a divide-and-conquer strategy

DART: a fast and accurate RNA-seq mapper with a divide and conquer strategy

Developers: Dr. Hsin-Nan Lin and Dr. Wen-Lian Hsu Institute of Information Science, Academia Sinica, Taiwan.

RNA-Seq technology can provide high resolution measurement of expression and high sensitivity in detecting low abundance transcripts. However, RNA-seq data requires a huge amount of computational efforts since this technology can produce sequence reads on the order of million/billion base-pairs in a single day. The very first step is to align each sequence fragment against the reference genome.

DART adopts a divide-and-conquer strategy to handle RNA-Seq transcript alignments. Unlike most of read aligners that try to ex-tend a seed in both directions with a dynamic programming step, DART divides a read sequence into one or more segments to re-place the seed extension step. The experiment results on synthetic datasets and real datasets show that DART is a highly efficient aligner that yields the highest sensitivity and accuracy and spends the least amount of time among the selected aligners.

Install Bioconda then type:

$ git clone https://github.com/hsinnan75/Dart.git

to download the package of DART.

To compile Dart, it requires libboost-all-dev, libbz2-dev, and liblzma-dev installed in your system.

We update DART from time to time, please check if new version is available by using the following commands.

with Kart version 1.2.7 up

or

$ git fetch
$ git merge origin/master master
$ make

To compile dart and the index tool, please change to dart's folder and just type 'make' to compile dart and bwt_index. If the compilation or the program fails, please contact me (arith@iis.sinica.edu.tw).

We provide the executable file, please type

to run the program. Or you can type 'make' to build the executable file.

To index a reference genome, DART requires the target genome file (in fasta format) and the prefix of the index files (including the directory path).

$ ./bwt_index ref_file[ex.ecoli.fa] index_prefix[ex. Ecoli]

or

$ ./dart index ref_file[ex.ecoli.fa] index_prefix[ex. Ecoli]

The above command is to index the genome file Ecoli.fa and store the index files begining with ecoli.

Please note that if you find bwt_index does not work in your computer system, you may also use bwa (http://bio-bwa.sourceforge.net/) to build the index files.

$ bwa index -p index_prefix ref.fa

To map short reads, DART requires the the index files of the reference genome and at least one read file (two read files for the separated paired-end reads). Users should use -i to specify the prefix of the index files (including the directory path).

case 1: standard sam output

$ ./dart -i ecoli -f ReadFile1.fa -f2 ReadFile2.fa -o out.sam

case 2: multiple input

$ ./dart -i ecoli -f ReadFileA_1.fq ReadFileB_1.fq ReadFileC_1.fq -f2 ReadFileA_2.fq ReadFileB_2.fq ReadFileC_2.fq -o out.sam

case 3: bam output

$ ./dart -i ecoli -f ReadFile1.fa -f2 ReadFile2.fa -bo out.bam

The above commands are to run DART to align the paired-end reads in ReadFile1.fq and ReadFile2.fq with index files of ecoli.


-t INT number of threads [16]

-i STR index prefix [BWT based (BWA), required]

-f STR read filename [required, fasta or fastq]

-f2 STR read filename2 [optional, fasta or fastq], f and f2 are files with paired reads

-p the input read file consists of interleaved paired-end sequences

-mis INT      maximal number of mismatches in an alignment

-max_dup INT  maximal number of repetitive fragments (between 100-10000) [100]

-o STR alignment output [SAM]

-bo STR alignment output [BAM]

-j STR predicted splice junction filename [junctions.tab]

-all_sj detect all possible splice junctions regardless of mapq score [false]

-m output multiple alignments [false]

-intron INT the maximal intron size [500000]

-unique output unique alignments


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4