BOL: Related items

Krona

Jit — Wed, 22 Mar 2017 04:47:35 -0500

Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an Excel template or KronaTools, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see Browser support).

Address of the bookmark: https://github.com/marbl/Krona/wiki

Prokka: tool for the rapid annotation of prokaryotic genomes

Jit — Mon, 06 Mar 2017 03:49:57 -0600

Prokka is a software tool for the rapid annotation of prokaryotic genomes. A typical 4 Mbp genome can be fully annotated in less than 10 minutes on a quad-core computer, and scales well to 32 core SMP systems. It produces GFF3, GBK and SQN files that are ready for editing in Sequin and ultimately submitted to Genbank/DDJB/ENA.

Address of the bookmark: http://www.vicbioinformatics.com/software.prokka.shtml

COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)

Jit — Tue, 07 Mar 2017 08:50:57 -0600

COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.

News: Python version of COCACOLA is available now!

Address of the bookmark: https://github.com/younglululu/COCACOLA

SSPACE

Jit — Fri, 05 May 2017 05:42:15 -0500

SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.

Address of the bookmark: https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE

MeDuSa: a multi-draft based scaffolder

Abhimanyu Singh — Wed, 14 Feb 2018 02:49:00 -0600

MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.

Address of the bookmark: https://github.com/combogenomics/medusa

Installing Trinity !

Rahul Nayak — Tue, 03 Jul 2018 04:31:15 -0500

Download this https://github.com/trinityrnaseq/trinityrnaseq/releases/tag/Trinity-v2.6.6

➜ cd trinityrnaseq-Trinity-v2.6.6

➜ trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ make
Using gnu compiler for Inchworm and Chrysalis
cd Inchworm && (test -e configure || autoreconf) \
&& sh ./configure --prefix=`pwd` && make install
checking for a BSD-compatible install... /usr/bin/install -c
checking whether build environment is sane... yes
checking for a thread-safe mkdir -p... /bin/mkdir -p
checking for gawk... gawk
checking whether make sets $(MAKE)... yes
checking for g++... g++
checking whether the C++ compiler works... yes
checking for C++ compiler default output file name... a.out
checking for suffix of executables...
checking whether we are cross compiling... no
checking for suffix of object files... o
checking whether we are using the GNU C++ compiler... yes
checking whether g++ accepts -g... yes
checking for style of include used by make... GNU
checking dependency style of g++... gcc3
checking for library containing cos... none required
configure: creating ./config.status
config.status: creating Makefile
config.status: creating src/Makefile
config.status: creating config.h
config.status: config.h is unchanged
config.status: executing depfiles commands
make[1]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
Making install in src
make[2]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/src'
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT Fasta_entry.o -MD -MP -MF .deps/Fasta_entry.Tpo -c -o Fasta_entry.o Fasta_entry.cpp
mv -f .deps/Fasta_entry.Tpo .deps/Fasta_entry.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT IRKE_run.o -MD -MP -MF .deps/IRKE_run.Tpo -c -o IRKE_run.o IRKE_run.cpp
mv -f .deps/IRKE_run.Tpo .deps/IRKE_run.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT sequenceUtil.o -MD -MP -MF .deps/sequenceUtil.Tpo -c -o sequenceUtil.o sequenceUtil.cpp
mv -f .deps/sequenceUtil.Tpo .deps/sequenceUtil.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT IRKE.o -MD -MP -MF .deps/IRKE.Tpo -c -o IRKE.o IRKE.cpp
mv -f .deps/IRKE.Tpo .deps/IRKE.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT KmerCounter.o -MD -MP -MF .deps/KmerCounter.Tpo -c -o KmerCounter.o KmerCounter.cpp
mv -f .deps/KmerCounter.Tpo .deps/KmerCounter.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT string_util.o -MD -MP -MF .deps/string_util.Tpo -c -o string_util.o string_util.cpp
mv -f .deps/string_util.Tpo .deps/string_util.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT Fasta_reader.o -MD -MP -MF .deps/Fasta_reader.Tpo -c -o Fasta_reader.o Fasta_reader.cpp
mv -f .deps/Fasta_reader.Tpo .deps/Fasta_reader.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT stacktrace.o -MD -MP -MF .deps/stacktrace.Tpo -c -o stacktrace.o stacktrace.cpp
mv -f .deps/stacktrace.Tpo .deps/stacktrace.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT argProcessor.o -MD -MP -MF .deps/argProcessor.Tpo -c -o argProcessor.o argProcessor.cpp
mv -f .deps/argProcessor.Tpo .deps/argProcessor.Po
g++ -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -o inchworm Fasta_entry.o IRKE_run.o sequenceUtil.o IRKE.o KmerCounter.o string_util.o Fasta_reader.o stacktrace.o argProcessor.o
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT cigar_tweaker.o -MD -MP -MF .deps/cigar_tweaker.Tpo -c -o cigar_tweaker.o cigar_tweaker.cpp
mv -f .deps/cigar_tweaker.Tpo .deps/cigar_tweaker.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT SAM_entry.o -MD -MP -MF .deps/SAM_entry.Tpo -c -o SAM_entry.o SAM_entry.cpp
mv -f .deps/SAM_entry.Tpo .deps/SAM_entry.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT SAM_reader.o -MD -MP -MF .deps/SAM_reader.Tpo -c -o SAM_reader.o SAM_reader.cpp
mv -f .deps/SAM_reader.Tpo .deps/SAM_reader.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT Cigar.o -MD -MP -MF .deps/Cigar.Tpo -c -o Cigar.o Cigar.cpp
mv -f .deps/Cigar.Tpo .deps/Cigar.Po
g++ -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -o cigar_tweaker cigar_tweaker.o SAM_entry.o sequenceUtil.o SAM_reader.o Cigar.o string_util.o stacktrace.o Fasta_reader.o Fasta_entry.o
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT pull_reads_with_kmers.o -MD -MP -MF .deps/pull_reads_with_kmers.Tpo -c -o pull_reads_with_kmers.o pull_reads_with_kmers.cpp
mv -f .deps/pull_reads_with_kmers.Tpo .deps/pull_reads_with_kmers.Po
g++ -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -o pull_reads_with_kmers pull_reads_with_kmers.o Fasta_reader.o Fasta_entry.o sequenceUtil.o KmerCounter.o string_util.o stacktrace.o argProcessor.o
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT FastaToDeBruijn.o -MD -MP -MF .deps/FastaToDeBruijn.Tpo -c -o FastaToDeBruijn.o FastaToDeBruijn.cpp
FastaToDeBruijn.cpp: In function ‘void createGraphPerRecord(std::vector >, int, bool, ArgProcessor)’:
FastaToDeBruijn.cpp:199:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (seq_region.size() < kmer_length) { continue; } // can be e
^
mv -f .deps/FastaToDeBruijn.Tpo .deps/FastaToDeBruijn.Po
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT DeBruijnGraph.o -MD -MP -MF .deps/DeBruijnGraph.Tpo -c -o DeBruijnGraph.o DeBruijnGraph.cpp
mv -f .deps/DeBruijnGraph.Tpo .deps/DeBruijnGraph.Po
g++ -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -o FastaToDeBruijn FastaToDeBruijn.o argProcessor.o Fasta_reader.o Fasta_entry.o sequenceUtil.o string_util.o stacktrace.o DeBruijnGraph.o
g++ -DHAVE_CONFIG_H -I. -I.. -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -MT fastaToKmerCoverageStats.o -MD -MP -MF .deps/fastaToKmerCoverageStats.Tpo -c -o fastaToKmerCoverageStats.o fastaToKmerCoverageStats.cpp
fastaToKmerCoverageStats.cpp: In function ‘void populate_kmer_counter_from_reads(KmerCounter&, std::__cxx11::string&)’:
fastaToKmerCoverageStats.cpp:226:18: warning: unused variable ‘kmer_length’ [-Wunused-variable]
unsigned int kmer_length = kcounter.get_kmer_length();
^
mv -f .deps/fastaToKmerCoverageStats.Tpo .deps/fastaToKmerCoverageStats.Po
g++ -std=c++0x -pedantic -fopenmp -Wall -Wextra -Wno-deprecated -m64 -g -O2 -o fastaToKmerCoverageStats fastaToKmerCoverageStats.o argProcessor.o Fasta_reader.o Fasta_entry.o sequenceUtil.o string_util.o stacktrace.o KmerCounter.o
make[3]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/src'
test -z "/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/bin" || /bin/mkdir -p "/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/bin"
/usr/bin/install -c inchworm cigar_tweaker pull_reads_with_kmers FastaToDeBruijn fastaToKmerCoverageStats '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/bin'
make[3]: Nothing to be done for 'install-data-am'.
make[3]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/src'
make[2]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm/src'
make[2]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
make[3]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
make[3]: Nothing to be done for 'install-exec-am'.
make[3]: Nothing to be done for 'install-data-am'.
make[3]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
make[2]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
make[1]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Inchworm'
cd Chrysalis && make UNSUPPORTED=yes
make[1]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Chrysalis'
./MakeDepend.cc: In member function ‘bool makefile_builder::dependency::operator<(const makefile_builder::dependency&) const’:
./MakeDepend.cc:93:47: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
dependent_ == other.dependent_ &&
^
./MakeDepend.cc: In member function ‘bool makefile_builder::subdir_and_target::operator<(const makefile_builder::subdir_and_target&) const’:
./MakeDepend.cc:130:41: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
subdir_ == other.subdir_ &&
^
./MakeDepend.cc: In function ‘int main(int, char**)’:
./MakeDepend.cc:223:20: warning: deprecated conversion from string constant to ‘char*’ [-Wwrite-strings]
char * options = "Ad:g:u:fh";
^
./MakeDepend.cc: In member function ‘void makefile_builder::DumpDependencies(const string&)’:
./MakeDepend.cc:491:46: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if ( ! this->FileIsSource( dependent ) && ! this->FileIsHeader( dependent
^
./MakeDepend.cc:493:44: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
this->FileIsHeader( dependent ) && this->FileIsSource( provider ) )
^
./MakeDepend.cc: In member function ‘bool makefile_builder::FileIsHeader(const string&) const’:
./MakeDepend.cc:1339:32: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
return ( filename.size() > 2 &&
^
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:04 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./aligns/KmerAlignCore.cc -o obj/aligns/KmerAlignCore.o
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:06 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/AACodons.cc -o obj/analysis/AACodons.o
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:09 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/BreakTransByPairs.cc -o obj/analysis/BreakTransByPairs.o
./analysis/BreakTransByPairs.cc: In function ‘int main(int, char**)’:
./analysis/BreakTransByPairs.cc:105:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i > DeBruijnGraph::get_candidate_weldmers(kmer_int_type_t, int)’:
./analysis/DeBruijnGraph.cc:473:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < left_extensions.size(); i++) {
^
./analysis/DeBruijnGraph.cc:476:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0; j < right_extensions.size(); j++) {
^
./analysis/DeBruijnGraph.cc: In member function ‘void DeBruijnGraph::recursively_construct_kmer_extensions(kmer_int_type_t, std::vector&, std::vector >&, char, std::map&, int)’:
./analysis/DeBruijnGraph.cc:513:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < adjacent_kmers.size(); i++) {
^
./analysis/DeBruijnGraph.cc:527:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (kmer_extension_chars.size() == flank_extension_length) {
^
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:30 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/sequenceUtil.cc -o obj/analysis/sequenceUtil.o
./analysis/sequenceUtil.cc: In function ‘bool contains_non_gatc(std::__cxx11::string)’:
./analysis/sequenceUtil.cc:33:20: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if (_base_to_int[c] > 3)
^
./analysis/sequenceUtil.cc: In function ‘kmer_int_type_t kmer_to_intval(std::__cxx11::string)’:
./analysis/sequenceUtil.cc:264:26: warning: array subscript has type ‘char’ [-Wchar-subscripts]
int val = _base_to_int[c];
^
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:31 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/stacktrace.cc -o obj/analysis/stacktrace.o
/bin/rm -f lib_BubbleUpClustering_temp.a
ar -qc lib_BubbleUpClustering_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/BubbleUpClustering.o obj/analysis/DNAVector.o obj/analysis/DeBruijnGraph.o obj/analysis/KmerTable.o obj/analysis/NonRedKmerTable.o obj/analysis/sequenceUtil.o obj/analysis/stacktrace.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./BubbleUpClustering
g++ -ggdb3 -fopenmp -o ./BubbleUpClustering obj/analysis/BubbleUpClustering.o -L. -lm -pthread -l_BubbleUpClustering_temp
/bin/rm lib_BubbleUpClustering_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:32 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/Chrysalis.cc -o obj/analysis/Chrysalis.o
./analysis/Chrysalis.cc: In function ‘int main(int, char**)’:
./analysis/Chrysalis.cc:384:28: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
system(command.c_str());
^
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:35 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/TranscriptomeGraph.cc -o obj/analysis/TranscriptomeGraph.o
./analysis/TranscriptomeGraph.cc: In function ‘int TranscriptomeGraph(vecDNAVector&, FILE*, int, bool)’:
./analysis/TranscriptomeGraph.cc:668:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i<=d.isize()-k; i++) {
^
/bin/rm -f lib_Chrysalis_temp.a
ar -qc lib_Chrysalis_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/Chrysalis.o obj/analysis/DNAVector.o obj/analysis/TranscriptomeGraph.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./Chrysalis
g++ -ggdb3 -fopenmp -o ./Chrysalis obj/analysis/Chrysalis.o -L. -lm -pthread -l_Chrysalis_temp
/bin/rm lib_Chrysalis_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:39 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/CreateIwormFastaBundle.cc -o obj/analysis/CreateIwormFastaBundle.o
/bin/rm -f lib_CreateIwormFastaBundle_temp.a
ar -qc lib_CreateIwormFastaBundle_temp.a obj/analysis/AACodons.o obj/analysis/CreateIwormFastaBundle.o obj/analysis/DNAVector.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./CreateIwormFastaBundle
g++ -ggdb3 -fopenmp -o ./CreateIwormFastaBundle obj/analysis/CreateIwormFastaBundle.o -L. -lm -pthread -l_CreateIwormFastaBundle_temp
/bin/rm lib_CreateIwormFastaBundle_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:42 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/GraphFromFasta.cc -o obj/analysis/GraphFromFasta.o
./analysis/GraphFromFasta.cc: In function ‘bool SimpleHalves(const DNAVector&)’:
./analysis/GraphFromFasta.cc:255:15: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
&&
^
./analysis/GraphFromFasta.cc: In function ‘void report_iworm_graph(std::map&, std::map&)’:
./analysis/GraphFromFasta.cc:631:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0; j < adjacent_nodes.size(); j++) {
^
./analysis/GraphFromFasta.cc: In function ‘int main(int, char**)’:
./analysis/GraphFromFasta.cc:1164:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i bubble_up_cluster_growth(std::map&, std::map&)’:
./GraphFromFasta_MPI.cc:706:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < pool_vec.size(); i++) {
^
./GraphFromFasta_MPI.cc:727:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < pool_vec.size(); i++) {
^
./GraphFromFasta_MPI.cc:834:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < pool_vec.size(); i++) {
^
./GraphFromFasta_MPI.cc: In function ‘void add_unclustered_iworm_contigs(svec&, vecDNAVector&)’:
./GraphFromFasta_MPI.cc:1144:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (size_t i = 0; i < p.size(); i++) {
^
./GraphFromFasta_MPI.cc: In function ‘int main(int, char**)’:
./GraphFromFasta_MPI.cc:1453:60: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (iworm_counter % 1000 == 0 || iworm_counter == dna.size()-1) {
^
./GraphFromFasta_MPI.cc:1458:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0; j<=d.isize()-k; j++) {
^
./GraphFromFasta_MPI.cc:1479:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (c == i)
^
./GraphFromFasta_MPI.cc:1503:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (c == i)
^
./GraphFromFasta_MPI.cc:2235:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0; j<=d.isize()-k; j++) {
^
./GraphFromFasta_MPI.cc:2264:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (c == i) {
^
./GraphFromFasta_MPI.cc:2359:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (c == i) {
^
./GraphFromFasta_MPI.cc:2475:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i ^
./GraphFromFasta_MPI.cc:2483:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (size_t j = 0; j < p.size(); j++) {
^
./GraphFromFasta_MPI.cc:2496:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (size_t j = 0; j < p.size(); j++) {
^
/bin/rm -f lib_GraphFromFasta_MPI_temp.a
ar -qc lib_GraphFromFasta_MPI_temp.a obj/GraphFromFasta_MPI.o obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/DeBruijnGraph.o obj/analysis/KmerTable.o obj/analysis/NonRedKmerTable.o obj/analysis/sequenceUtil.o obj/analysis/stacktrace.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./GraphFromFasta_MPI
g++ -ggdb3 -fopenmp -o ./GraphFromFasta_MPI obj/GraphFromFasta_MPI.o -L. -lm -pthread -l_GraphFromFasta_MPI_temp
/bin/rm lib_GraphFromFasta_MPI_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:53 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/IsoformAugment.cc -o obj/analysis/IsoformAugment.o
./analysis/IsoformAugment.cc: In function ‘int main(int, char**)’:
./analysis/IsoformAugment.cc:87:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0; j ^
./analysis/IsoformAugment.cc:122:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0; j ^
/bin/rm -f lib_IsoformAugment_temp.a
ar -qc lib_IsoformAugment_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/IsoformAugment.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./IsoformAugment
g++ -ggdb3 -fopenmp -o ./IsoformAugment obj/analysis/IsoformAugment.o -L. -lm -pthread -l_IsoformAugment_temp
/bin/rm lib_IsoformAugment_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:27:56 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/JoinTransByPairs.cc -o obj/analysis/JoinTransByPairs.o
./analysis/JoinTransByPairs.cc: In function ‘int main(int, char**)’:
./analysis/JoinTransByPairs.cc:293:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i ^
./analysis/JoinTransByPairs.cc:341:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (i=0; i ^
/bin/rm -f lib_JoinTransByPairs_temp.a
ar -qc lib_JoinTransByPairs_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/JoinTransByPairs.o obj/analysis/KmerTable.o obj/analysis/NonRedKmerTable.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./JoinTransByPairs
g++ -ggdb3 -fopenmp -o ./JoinTransByPairs obj/analysis/JoinTransByPairs.o -L. -lm -pthread -l_JoinTransByPairs_temp
/bin/rm lib_JoinTransByPairs_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:00 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/QuantifyGraph.cc -o obj/analysis/QuantifyGraph.o
/bin/rm -f lib_QuantifyGraph_temp.a
ar -qc lib_QuantifyGraph_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/KmerTable.o obj/analysis/NonRedKmerTable.o obj/analysis/QuantifyGraph.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./QuantifyGraph
g++ -ggdb3 -fopenmp -o ./QuantifyGraph obj/analysis/QuantifyGraph.o -L. -lm -pthread -l_QuantifyGraph_temp
/bin/rm lib_QuantifyGraph_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:03 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/ReadsToTranscripts.cc -o obj/analysis/ReadsToTranscripts.o
/bin/rm -f lib_ReadsToTranscripts_temp.a
ar -qc lib_ReadsToTranscripts_temp.a obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/NonRedKmerTable.o obj/analysis/ReadsToTranscripts.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./ReadsToTranscripts
g++ -ggdb3 -fopenmp -o ./ReadsToTranscripts obj/analysis/ReadsToTranscripts.o -L. -lm -pthread -l_ReadsToTranscripts_temp
/bin/rm lib_ReadsToTranscripts_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:09 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./ReadsToTranscripts_MPI.cc -o obj/ReadsToTranscripts_MPI.o
/bin/rm -f lib_ReadsToTranscripts_MPI_temp.a
ar -qc lib_ReadsToTranscripts_MPI_temp.a obj/ReadsToTranscripts_MPI.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/NonRedKmerTable.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./ReadsToTranscripts_MPI
g++ -ggdb3 -fopenmp -o ./ReadsToTranscripts_MPI obj/ReadsToTranscripts_MPI.o -L. -lm -pthread -l_ReadsToTranscripts_MPI_temp
/bin/rm lib_ReadsToTranscripts_MPI_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:14 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./ReadsToTranscripts_MPI_chang.cc -o obj/ReadsToTranscripts_MPI_chang.o
/bin/rm -f lib_ReadsToTranscripts_MPI_chang_temp.a
ar -qc lib_ReadsToTranscripts_MPI_chang_temp.a obj/ReadsToTranscripts_MPI_chang.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/NonRedKmerTable.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./ReadsToTranscripts_MPI_chang
g++ -ggdb3 -fopenmp -o ./ReadsToTranscripts_MPI_chang obj/ReadsToTranscripts_MPI_chang.o -L. -lm -pthread -l_ReadsToTranscripts_MPI_chang_temp
/bin/rm lib_ReadsToTranscripts_MPI_chang_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:18 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/RunButterfly.cc -o obj/analysis/RunButterfly.o
./analysis/RunButterfly.cc: In member function ‘void JobControl::ClearFiles()’:
./analysis/RunButterfly.cc:107:25: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
system(rm.c_str());
^
./analysis/RunButterfly.cc: In member function ‘void JobControl::Submit()’:
./analysis/RunButterfly.cc:77:27: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
system(theCmmd.c_str());
^
./analysis/RunButterfly.cc:85:27: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
system(theCmmd.c_str());
^
/bin/rm -f lib_RunButterfly_temp.a
ar -qc lib_RunButterfly_temp.a obj/analysis/RunButterfly.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./RunButterfly
g++ -ggdb3 -fopenmp -o ./RunButterfly obj/analysis/RunButterfly.o -L. -lm -pthread -l_RunButterfly_temp
/bin/rm lib_RunButterfly_temp.a
g++ -W -Wall -Wno-unused -Wno-deprecated -ansi -pedantic -Wno-long-long -fno-nonansi-builtins -Wctor-dtor-privacy -Wsign-promo -Woverloaded-virtual -Wendif-labels -O3 -ggdb3 -DMAKE_DATE='"Die Jul 3 11:28:23 CEST 2018 "' -DMAKE_OS_RELEASE='"4.4.0-128-generic"' -DMAKE_RELEASE='"3.0"' -DNEW_MAKEFILE -imacros system/BigFileDefines.h -pthread -ftemplate-depth-30 -fno-strict-aliasing -mieee-fp -iquote . -ISpines -fopenmp -c ./analysis/TranscriptomeFromVaryK.cc -o obj/analysis/TranscriptomeFromVaryK.o
./analysis/TranscriptomeFromVaryK.cc: In function ‘int main(int, char**)’:
./analysis/TranscriptomeFromVaryK.cc:216:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (j=0; j<=d.lsize()-k; j++) {
^
./analysis/TranscriptomeFromVaryK.cc:218:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int x=j; x ^
/bin/rm -f lib_TranscriptomeFromVaryK_temp.a
ar -qc lib_TranscriptomeFromVaryK_temp.a obj/aligns/KmerAlignCore.o obj/analysis/AACodons.o obj/analysis/DNAVector.o obj/analysis/KmerTable.o obj/analysis/NonRedKmerTable.o obj/analysis/TranscriptomeFromVaryK.o obj/base/ErrorHandling.o obj/base/FileParser.o obj/base/StringUtil.o obj/util/mutil.o
./checkLock ./TranscriptomeFromVaryK
g++ -ggdb3 -fopenmp -o ./TranscriptomeFromVaryK obj/analysis/TranscriptomeFromVaryK.o -L. -lm -pthread -l_TranscriptomeFromVaryK_temp
/bin/rm lib_TranscriptomeFromVaryK_temp.a
make[1]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/Chrysalis'
cd trinity-plugins && make trinity_essentials
make[1]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins'
tar xvf seqtk-trinity.v0.0.2.tar.gz
seqtk-trinity-0.0.2/
seqtk-trinity-0.0.2/.gitignore
seqtk-trinity-0.0.2/LICENSE
seqtk-trinity-0.0.2/Makefile
seqtk-trinity-0.0.2/README.md
seqtk-trinity-0.0.2/khash.h
seqtk-trinity-0.0.2/kseq.h
seqtk-trinity-0.0.2/seqtk.c
seqtk-trinity-0.0.2/testing/
seqtk-trinity-0.0.2/testing/newformat_1.fq
seqtk-trinity-0.0.2/testing/newformat_2.fq
seqtk-trinity-0.0.2/testing/oldformat_1.fq
seqtk-trinity-0.0.2/testing/oldformat_2.fq
cd seqtk-trinity-0.0.2 && make
make[2]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/seqtk-trinity-0.0.2'
gcc -g -Wall -O2 -Wno-unused-function seqtk.c -o seqtk-trinity -lz -lm
seqtk.c: In function ‘stk_comp’:
seqtk.c:444:16: warning: variable ‘lc’ set but not used [-Wunused-but-set-variable]
int la, lb, lc, na, nb, nc, cnt[11];
^
make[2]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/seqtk-trinity-0.0.2'
mv seqtk-trinity-0.0.2/seqtk-trinity ./BIN/.
tar -zxvf "ParaFly-0.1.0".tar.gz && \
cd "ParaFly-0.1.0" && sh ./configure --prefix=`pwd` && make install && \
cp bin/ParaFly ../BIN/
ParaFly-0.1.0/
ParaFly-0.1.0/LICENSE
ParaFly-0.1.0/Makefile
ParaFly-0.1.0/Makefile.am
ParaFly-0.1.0/Makefile.in
ParaFly-0.1.0/README.md
ParaFly-0.1.0/aclocal.m4
ParaFly-0.1.0/bin/
ParaFly-0.1.0/bin/ParaFly
ParaFly-0.1.0/config.h
ParaFly-0.1.0/config.h.in
ParaFly-0.1.0/config.log
ParaFly-0.1.0/config.status
ParaFly-0.1.0/configure
ParaFly-0.1.0/configure.ac
ParaFly-0.1.0/depcomp
ParaFly-0.1.0/install-sh
ParaFly-0.1.0/missing
ParaFly-0.1.0/src/
ParaFly-0.1.0/src/.deps/
ParaFly-0.1.0/src/.deps/ParaFly.Po
ParaFly-0.1.0/src/.deps/argProcessor.Po
ParaFly-0.1.0/src/Makefile
ParaFly-0.1.0/src/Makefile.am
ParaFly-0.1.0/src/Makefile.in
ParaFly-0.1.0/src/ParaFly.cpp
ParaFly-0.1.0/src/argProcessor.cpp
ParaFly-0.1.0/src/argProcessor.hpp
ParaFly-0.1.0/stamp-h1
ParaFly-0.1.0/test/
ParaFly-0.1.0/test/Makefile
ParaFly-0.1.0/test/cmds.txt
ParaFly-0.1.0/test/rand_exit.pl
checking for a BSD-compatible install... /usr/bin/install -c
checking whether build environment is sane... yes
checking for a thread-safe mkdir -p... /bin/mkdir -p
checking for gawk... gawk
checking whether make sets $(MAKE)... yes
checking for g++... g++
checking for C++ compiler default output file name... a.out
checking whether the C++ compiler works... yes
checking whether we are cross compiling... no
checking for suffix of executables...
checking for suffix of object files... o
checking whether we are using the GNU C++ compiler... yes
checking whether g++ accepts -g... yes
checking for style of include used by make... GNU
checking dependency style of g++... gcc3
checking for library containing cos... none required
configure: creating ./config.status
config.status: creating Makefile
config.status: creating src/Makefile
config.status: creating config.h
config.status: config.h is unchanged
config.status: executing depfiles commands
make[2]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
Making install in src
make[3]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/src'
g++ -DHAVE_CONFIG_H -I. -I.. -pedantic -fopenmp -Wall -Wextra -Wno-long-long -Wno-deprecated -m64 -g -O2 -MT ParaFly.o -MD -MP -MF .deps/ParaFly.Tpo -c -o ParaFly.o ParaFly.cpp
mv -f .deps/ParaFly.Tpo .deps/ParaFly.Po
g++ -DHAVE_CONFIG_H -I. -I.. -pedantic -fopenmp -Wall -Wextra -Wno-long-long -Wno-deprecated -m64 -g -O2 -MT argProcessor.o -MD -MP -MF .deps/argProcessor.Tpo -c -o argProcessor.o argProcessor.cpp
mv -f .deps/argProcessor.Tpo .deps/argProcessor.Po
g++ -pedantic -fopenmp -Wall -Wextra -Wno-long-long -Wno-deprecated -m64 -g -O2 -o ParaFly ParaFly.o argProcessor.o
make[4]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/src'
test -z "/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/bin" || /bin/mkdir -p "/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/bin"
/usr/bin/install -c ParaFly '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/bin'
make[4]: Nothing to be done for 'install-data-am'.
make[4]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/src'
make[3]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0/src'
make[3]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
make[4]: Entering directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
make[4]: Nothing to be done for 'install-exec-am'.
make[4]: Nothing to be done for 'install-data-am'.
make[4]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
make[3]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
make[2]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins/ParaFly-0.1.0'
ln -sf Trimmomatic-0.36 Trimmomatic
make[1]: Leaving directory '/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity-plugins'
sh ./util/support_scripts/trinity_install_tests.sh
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Performing Unit Tests of Build

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Inchworm: has been Installed Properly
Chrysalis: has been Installed Properly
QuantifyGraph: has been Installed Properly
GraphFromFasta: has been Installed Properly
ReadsToTranscripts: has been Installed Properly
parafly: has been Installed Properly
➜ trinityrnaseq-Trinity-v2.6.6 git:(master) ✗
➜ trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ ./Trinity

###############################################################################
#

______ ____ ____ ____ ____ ______ __ __
| || \ | || \ | || || | |
| || D ) | | | _ | | | | || | |
|_| |_|| / | | | | | | | |_| |_|| ~ |
| | | \ | | | | | | | | | |___, |
| | | . \ | | | | | | | | | | |
|__| |__|\_||____||__|__||____| |__| |____/

#
#
# Required:
#
# --seqType :type of reads: ('fa' or 'fq')
#
# --max_memory :suggested max memory to use by Trinity where limiting can be enabled. (jellyfish, sorting, etc)
# provided in Gb of RAM, ie. '--max_memory 10G'
#
# If paired reads:
# --left :left reads, one or more file names (separated by commas, no spaces)
# --right :right reads, one or more file names (separated by commas, no spaces)
#
# Or, if unpaired reads:
# --single :single reads, one or more file names, comma-delimited (note, if single file contains pairs, can use flag: --run_as_paired )
#
# Or,
# --samples_file tab-delimited text file indicating biological replicate relationships.
# ex.
# cond_A cond_A_rep1 A_rep1_left.fq A_rep1_right.fq
# cond_A cond_A_rep2 A_rep2_left.fq A_rep2_right.fq
# cond_B cond_B_rep1 B_rep1_left.fq B_rep1_right.fq
# cond_B cond_B_rep2 B_rep2_left.fq B_rep2_right.fq
#
# # if single-end instead of paired-end, then leave the 4th column above empty.
#
####################################
## Misc: #########################
#
# --SS_lib_type :Strand-specific RNA-Seq read orientation.
# if paired: RF or FR,
# if single: F or R. (dUTP method = RF)
# See web documentation.
#
# --CPU :number of CPUs to use, default: 2
# --min_contig_length :minimum assembled contig length to report
# (def=200)
#
# --long_reads :fasta file containing error-corrected or circular consensus (CCS) pac bio reads
# (** note: experimental parameter **, this functionality continues to be under development)
#
# --genome_guided_bam :genome guided mode, provide path to coordinate-sorted bam file.
# (see genome-guided param section under --show_full_usage_info)
#
# --jaccard_clip :option, set if you have paired reads and
# you expect high gene density with UTR
# overlap (use FASTQ input file format
# for reads).
# (note: jaccard_clip is an expensive
# operation, so avoid using it unless
# necessary due to finding excessive fusion
# transcripts w/o it.)
#
# --trimmomatic :run Trimmomatic to quality trim reads
# see '--quality_trimming_params' under full usage info for tailored settings.
#
#
# --no_normalize_reads :Do *not* run in silico normalization of reads. Defaults to max. read coverage of 50.
# see '--normalize_max_read_cov' under full usage info for tailored settings.
# (note, as of Sept 21, 2016, normalization is on by default)
#
# --no_distributed_trinity_exec :do not run Trinity phase 2 (assembly of partitioned reads), and stop after generating command list.
#
#
# --output :name of directory for output (will be
# created if it doesn't already exist)
# default( your current working directory: "/home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/trinity_out_dir"
# note: must include 'trinity' in the name as a safety precaution! )
#
# --workdir :where Trinity phase-2 assembly computation takes place (defaults to --output setting).
# (can set this to a node-local drive or RAM disk)
#
# --full_cleanup :only retain the Trinity fasta file, rename as ${output_dir}.Trinity.fasta
#
# --cite :show the Trinity literature citation
#
# --verbose :provide additional job status info during the run.
#
# --version :reports Trinity version (Trinity-v2.6.6) and exits.
#
# --show_full_usage_info :show the many many more options available for running Trinity (expert usage).
#
#
###############################################################################
#
# *Note, a typical Trinity command might be:
#
# Trinity --seqType fq --max_memory 50G --left reads_1.fq --right reads_2.fq --CPU 6
#
#
# and for Genome-guided Trinity:
#
# Trinity --genome_guided_bam rnaseq_alignments.csorted.bam --max_memory 50G
# --genome_guided_max_intron 10000 --CPU 6
#
# see: /home/urbe/Tools/trinityrnaseq-Trinity-v2.6.6/sample_data/test_Trinity_Assembly/
# for sample data and 'runMe.sh' for example Trinity execution
#
# For more details, visit: http://trinityrnaseq.github.io
#
###############################################################################

Industrial Training in Computer Aided Drug Designing (CADD)

RASA Life Sciences — Wed, 13 Nov 2019 05:00:44 -0600

Learn More about Computer Aided Drug Designing (CADD)!!!

#rasalsi #rasa In our Industrial program you will get Knowledge on RNA Seq, CHIP Seq,

Batch Starts From 18^th November 2019

#hurryup #registernow #enquirenow The primary goal of the industrial training program is to provide students with necessary skills making with employable. RASA LSI trains students with the enhanced skills required for them to excel in jobs in biotechnology, pharmaceuticals, BioIT and related industry sectors. At Rasa you will learn from industry leaders how to apply these skills in life science & have a command over software developing process by using various methodologies. For Registration visit us on: https://www.rasalsi.com/index.php/front-page/industrial-training/

Post Doc Computational Biology, Bioinformatics - Network Biology & Data Science, NGS (m/f/d)

Sat, 15 Feb 2020 06:13:35 -0600

https://www.jobvector.de/jobs-stellenangebote/biologie-life-sciences/forschung-entwicklung/post-doc-computational-biology-bioinformatics-network-biology-data-science-ngs-129867.html?suid=e522e9793b41817e52ac58d6963b94e2519920df

Requirements
Doctoral degree in Bioinformatics, Computational Biology, (Bio)physics/-mathematics, Biochemistry/Biology or similar with strong quantitative and numeric focus
Ability to numerically process complex and large data sets
Good programming skills (R/Bioconductor and/or Python preferred, Linux is a plus)
Experience in analyzing next-generation sequencing data sets using network biology
Scientific publication record in applied bioinformatics
Familiarity with single cell NGS analyses and other –omics techniques is a plus, but not essential

Jayaram Lab

Sun, 14 Jul 2013 14:04:37 -0500

Responsible (a) for developing Chemgenome, Bhageerath & Sanjeevini methods & softwares for genome annotation, protein tertiary structure prediction & computer aided drug design respectively, (b) for setting up a multi-teraflop supercomputing facility for Bioinformatics & Computational Biology at IIT Delhi, and (c) for making the hardware and software freely accessible at (www.scfbio-iitd.res.in) to the global scientific user community.

Faculty facilitator/Founder Director for two start-up companies (Leadinvent incubated at IIT, Delhi from 2006-2009 & Novoinformatics, under incubation at IIT Delhi since 2011).

Research Interest
Genome Analysis, Protein Structure Prediction and Drug Design.

Link @ http://www.scfbio-iitd.res.in/

Bioinformatics Algorithms

Jitendra Narayan — Tue, 16 Jul 2013 03:35:15 -0500

An algorithm is a computable set of steps to achieve a desired result.

We use algorithms every day. For example, a recipe for baking a cake is an algorithm. Most programs, with the exception of some artificial intelligence applications, consist of algorithms. Inventing elegant algorithms -- algorithms that are simple and require the fewest steps possible -- is one of the principal challenges in programming. An algorithm is a description of a procedure which terminates with a result. In other words an algorithm is a set of instructions, sometimes called a procedure or a function, that is used to perform a certain task. This can be a simple process, such as adding two numbers together, or a complex function, such as adding effects to an image. For example, in order to sharpen a digital photo, the algorithm would need to process each pixel in the image and determine which ones to change and how much to change them in order to make the image look sharper.

In mathematics, computer science, and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields.
Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness.

History

The origin of the term comes from the ancients. The concept becomes more precise with the use of variables in mathematics. Algorithm in the sense of what is now used by computers appeared as soon as first mechanical engines were invented.
The word algorithm comes from the name of the 9th century Persian Muslim mathematician Abu Abdullah Muhammad ibn Musa Al-Khwarizmi. The word algorism originally referred only to the rules of performing arithmetic using Hindu-Arabic numerals but evolved via European Latin translation of Al-Khwarizmi's name into algorithm by the 18th century. The use of the word evolved to include all definite procedures for solving problems or performing tasks.
The algorithm of Archimedes gives an approximation of the Pi number.
Eratosthenes has defined an algorithim for retrieving prime numbers.
Averroès (1126-1198) was using algorithmic methods for calculations.
Adelard de Bath (12 th) introduces the algorismus term, from Al-Khwarizmi.
During the 1800's up to the mid-1900's:

- George Boole (1847) has invented the binary algebra, the basis of computers. Actually he has unified logic and calculation in a common symbolism.

- Gottlob Frege (1879) formula language's, that is a lingua characterica, a language written with special symbols, "for pure thought", that is free from rhetorical embellishments... constructed from specific symbols that are manipulated according to definite rules.

- Giuseppe Peano (1888) It's The principles of arithmetic, presented by a new method was the first attempt at an axiomatization of mathematics in a symbolic language.

- Alfred North Whitehead and Bertrand Russell in their Principia Mathematica (1910-1913) has further simplified and amplified the work of Frege.

- Kurt Goëdel (1931) cites the paradox of the liar that completely reduces rules of recursion to numbers.

The concept of algorithm was formalized in 1936 through Alan Turing's Turing machines and Alonzo Church's lambda calculus, which in turn formed the foundation of computer science.
Stephen C. Kleene (1943) defined his now-famous thesis known as the "Church-Turing Thesis". In this context:

" Algorithmic theories... In setting up a complete algorithmic theory, what we do is to describe a procedure, performable for each set of values of the independent variables, which procedure necessarily terminates and in such manner that from the outcome we can read a definite answer, "yes" or "no," to the question, "is the predicate value true?"

Classification

Classification by purpose

Each algorithm has a goal, for example, the purpose of the Quick Sort algorithm is to sort data in ascending or descending order. But the number of goals is infinite, and we have to group them by kind of purposes:

Classification by implementation

An algorithm may be implemeted according to different basical principles.

Recursive or iterative

A recursive algorithm is one that calls itself repeatedly until a certain condition matches. It is a method common to functional programming.
Iterative algorithms use repetitive constructs like loops.
Some problems are better suited for one implementation or the other. For example, the towers of hanoi problem is well understood in recursive implementation. Every recursive version has an iterative equivalent iterative, and vice versa.

Logical or procedural

An algorithm may be viewed as controlled logical deduction.
A logic component expresses the axioms which may be used in the computation and a control component determines the way in which deduction is applied to the axioms.
This is the basis of the logic programming. In pure logic programming languages the control component is fixed and algorithms are specified by supplying only the logic component.

Serial or parallel

Algorithms are usually discussed with the assumption that computers execute one instruction of an algorithm at a time. This is a serial algorithm, as opposed to parallel algorithms, which take advantage of computer architectures to process several instructions at once. They divide the problem into sub-problems and pass them to several processors. Iterative algorithms are generally parallelizable. Sorting algorithms can be parallelized efficiently.

Deterministic or non-deterministic

Deterministic algorithms solve the problem with a predefined process whereas non-deterministic algorithm must perform guesses of best solution at each step through the use of heuristics.

Classification by design paradigm

A design paradigm is a domain in research or class of problems that requires a dedicated kind of algorithm:

Divide and conquer

A divide and conquer algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively), until the instances are small enough to solve easily. One such example of divide and conquer is merge sorting. Sorting can be done on each segment of data after dividing data into segments and sorting of entire data can be obtained in conquer phase by merging them.
The binary search algorithm is an example of a variant of divide and conquer called decrease and conquer algorithm, that solves an identical subproblem and uses the solution of this subproblem to solve the bigger problem.

Dynamic programming

The shortest path in a weighted graph can be found by using the shortest path to the goal from all adjacent vertices.
When the optimal solution to a problem can be constructed from optimal solutions to subproblems, using dynamic programming avoids recomputing solutions that have already been computed.
- The main difference with the "divide and conquer" approach is, subproblems are independent in divide and conquer, where as the overlap of subproblems occur in dynamic programming.
- Dynamic programming and memoization go together. The difference with straightforward recursion is in caching or memoization of recursive calls. Where subproblems are independent, this is useless. By using memoization or maintaining a table of subproblems already solved, dynamic programming reduces the exponential nature of many problems to polynomial complexity.

The greedy method

A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage. Instead a "greedy" choice can be made of what looks the best solution for the moment.
The most popular greedy algorithm is finding the minimal spanning tree as given by Kruskal.

Linear programming

The problem is expressed as a set of linear inequalities and then an attempt is made to maximize or minimize the inputs. This can solve many problems such as the maximum flow for directed graphs, notably by using the simplex algorithm.
A complex variant of linear programming is called integer programming, where the solution space is restricted to all integers.

Reduction also called transform and conquer

Solve a problem by transforming it into another problem. A simple example: finding the median in an unsorted list is first translating this problem into sorting problem and finding the middle element in sorted list. The main goal of reduction is finding the simplest transformation possible.

Using graphs

Many problems, such as playing chess, can be modeled as problems on graphs. A graph exploration algorithms are used.
This category also includes the search algorithms and backtracking.

The probabilistic and heuristic paradigm

Probabilistic

Those that make some choices randomly.

Genetic

Attempt to find solutions to problems by mimicking biological evolutionary processes, with a cycle of random mutations yielding successive generations of "solutions". Thus, they emulate reproduction and "survival of the fittest".

Heuristic

Whose general purpose is not to find an optimal solution, but an approximate solution where the time or resources to find a perfect solution are not practical.

Classification by complexity

Some algorithms complete in linear time, and some complete in exponential amount of time, and some never complete.

Algorithms resources on net.

Graph Algorithms in Bioinformatics

Bioinformatics Algorithms Description

Bioinformatics Algorithms Course Page

Bioinformatics Algorithm Demonstrations

Introduction to Bioinformatics Algorithms Lectures 1-2 by Dr. Max Alekseyev USC, 2009

Online Lectures on Bioinformatics

Sequence Alignment Algorithms

Algorithm for sequence alignment: dynamic programming

Network Protocol Analysis using Bioinformatics Algorithms