University of Ibadan (UIB)­Ibadan:
There has been significant increase in the number of bioinformatics activities in Nigeria (and West Africa) since 2003 when the program was initiated by the West African Biotechnology Workshops Series (WABWS, http://www.wabw.org) at the University of Ibadan, Nigeria (in collaboration with  the South African National Bioinformatics Institute (SANBI, http:/www.sanbi.ac.za). Workshops  that were open to scientists from all African countries have seen a very high number of applications  from scientists based in West Africa. The encouraging desire to acquire cutting­edge skills to  computational process data and extract useful knowledge from genome projects led to the interest of  the West African Biotechnology Workshops (WABW) to develop an agenda to address the  bioinformatics skills gap among scientists in West Africa. An increased commitment from agencies  like NEPAD would be required in the provision of infrastructure to establish and sustain regional  and national networks.

University of Ilorin (UIL)­Ilorin:
The University of Ilorin was established in 1976 by the Federal Government of Nigeria.  Bioinformatics activities started at the University in February 2003 with the establishment of the  West African Bioinformatics Research Initiative (WABRI). However, progress has been rather slow  due to inadequate funding. We are mainly engaged in Bioinformatics training at the introductory  level and proteomics studies on various species of malaria parasites. Recently, we became interested  in comparative genome analysis of various species of  Plasmodium  and the comparison of  chloroquine sensitive and chloroquine resistant strains of Plasmodium falciparum. Other activities  and areas of interest can be seen on our website, http://www.wabri.org, although not all our  proposed interests have been fully implemented due to our level of funding.

Training:
The University of Ilorin has introduced M.Sc. and Ph.D. programmes in Computer Science (with  options in Bioinformatics). The programme is based in the Department of Computer Science and  emphasis is on the development of algorithms to solve problems in bioinformatics. The Covenant University offers M.Sc. and Ph.D in Computer Science with option in Bioinformatics  (Computational Biology). Furthermore, through affiliated departments, the CBBM is been design to award Diploma and Degree certificates in Biotechnology.

Web sites and links: http://www.covenantuniversity.com http://www.run.edu.ng http://www.uniben.edu http://www.wabri.org http://www.wabw.org http://www.unilorin.edu.ng http://www.wabri.org http://www.asopah.org

1️⃣ Data Analysis for the Life Sciences
A fantastic starting point to learn statistics, R programming, and exploratory data analysis in the context of biology. The best part? It’s available free online from HarvardX.

2️⃣ Practical Computing for Biologists
The very first book I picked up when I started learning computational biology. It’s beginner-friendly and focuses on essential computing skills every biologist needs.

3️⃣ A Primer for Computational Biology
An open-access, hands-on introduction to computational biology concepts and coding techniques. Perfect if you want to learn through real examples.

4️⃣ Computational Genomics with R
For those who already know R and want to dive deeper into genome-scale data analysis, from sequence alignment to gene expression.

5️⃣ The Biologist’s Guide to Computing
Bridges the gap between biological problems and computational thinking, making it easier for life scientists to approach programming and data analysis.

6️⃣ Bioinformatics Data Skills
A must-read to sharpen your bioinformatics toolkit — from command-line skills to reproducible research workflows. Ideal once you’ve covered the basics.

7️⃣ Bioinformatics Workbook
A practical tutorial series to help scientists design bioinformatics projects, analyze data, and understand best practices.

8️⃣ Modern Statistics for Modern Biology
An essential guide to modern statistical methods applied to biology, blending theory with hands-on examples in R.

9️⃣ Algorithms on Strings, Trees, and Sequences by Dan Gusfield
A classic reference for anyone wanting to understand the algorithms behind sequence alignment, genome assembly, and biological data structures.

Professionally, Python is great for backend web development, data analysis, artificial intelligence, and scientific computing. Many developers have also used Python to build productivity tools, games, and desktop apps, so there are plenty of resources to help you learn how to do those as well.

For pros and cons visit http://www.bestprogramminglanguagefor.me/why-learn-python and http://bioinformaticsonline.com/discussion/view/459/python-vs-perl

More resources at https://github.com/CodementorIO/Python-Learning-Resources

Following are the list of useful python programming resources:

• 20 Python Libraries You Aren't Using (But Should) (Just fill the fields with any values)
• A Beginner's Python Tutorial
• A Byte of Python (3.x) (HTML, PDF, EPUB, Mobi)
• A Guide to Python's Magic Methods - Rafe Kettler
• A Whirlwind Tour of Python - Jake VanderPlas (PDF) (EPUB, MOBI)
• Automate the Boring Stuff - Al Sweigart
• Biopython (PDF)
• Build applications in Python the antitextbook (3.x) (HTML, PDF, EPUB, Mobi)
• Building Machine Learning Systems with Python - Willi Richert & Luis Pedro Coelho, Packt. (Just fill the fields with any values)
• Building Skills in Object-Oriented Design (Python) (PDF) (2.1.1)
• Building Skills in Python (PDF) (2.6)
• Code Like a Pythonista: Idiomatic Python
• CodeCademy Python
• Composing Programs (3.x)
• Data Structures and Algorithms in Python - B. R. Preiss (PDF)
• Dive into Python 3 - Mark Pilgrim (3.0)
  • Dive into Python - Mark Pilgrim (2.3)
• From Python to NumPy
• Full Stack Python
• Functional Programming in Python (Just fill the fields with any values)
• Fundamentals of Python Programming - Richard L. Halterman (PDF) (3.2)
• Google's Python Class (2.4 - 2.x)
• Google's Python Style Guide
• Hacking Secret Cyphers with Python - Al Sweigart (3.3)
• Hadoop with Python (Just fill the fields with any values)
• High Performance Python (PDF)
• Hitchhiker's Guide to Python! (2.6)
• How to Make Mistakes in Python - Mike Pirnat (PDF) (1st edition)
• How to Think Like a Computer Scientist: Learning with Python, Interactive Edition (3.2)
  • How to Think Like a Computer Scientist: Learning with Python - Allen B. Downey, Jeff Elkner and Chris Meyers (2.4)
  • Think Python - Allen B. Downey (2.x & 3.0)
• Intermediate Python - Muhammad Yasoob Ullah Khalid (1st edition)
• Introduction to Programming with Python (3.3)
  • Introduction to Programming Using Python - Cody Jackson (1st edition) (2.3)
• Introduction to Python - Kracekumar (2.7.3)
• Invent Your Own Computer Games With Python - Al Sweigart (3.1)
• Learn Python, Break Python
• Learn Python in Y minutes
• Learn Python The Hard Way (2.5 - 2.6)
• Learn to Program Using Python - Cody Jackson (PDF)
• Learning Python - Fabrizio Romano, Packt. (Just fill the fields with any values)
• Learning to Program
• Lectures on scientific computing with python - J.R. Johansson (2.7)
• Making Games with Python & Pygame - Al Sweigart (2.7)
• Modeling Creativity: Case Studies in Python - Tom D. De Smedt (PDF)
• Natural Language Processing with Python (3.x)
• Non-Programmer's Tutorial for Python 3 (3.3)
  • Non-Programmer's Tutorial for Python 2.6 (2.6)
• Picking a Python Version: A Manifesto (Just fill the fields with any values)
• Porting to Python 3: An In-Depth Guide (2.6 - 2.x & 3.1 - 3.x)
• Practical Programming in Python - Jeffrey Elkner (PDF)
• Problem Solving with Algorithms and Data Structures using Python - Bradley N. Miller and David L. Ranum
• Program Arcade Games With Python And Pygame (3.3)
• Programming Computer Vision with Python (PDF)
• Python 2 Official Documentation (PDF, HTML, TEXT) (2.x)
• Python 2.7 quick reference - New Mexico Tech (2.7)
• Python 3 Official Documentation (PDF, EPUB, HTML, TEXT) (3.x)
• Python Cookbook - David Beazley
• Python Data Science Handbook - Jake VanderPlas (HTML, Jupyter Notebooks)
• Python for Econometrics - Kevin Sheppard (PDF) (2.7.5)
• Python for Everybody Exploring Data Using Python 3 - Charles Severance (PDF, EPUB, HTML)
  • Python for Informatics: Exploring Information (2.7.5)
• Python for you and me (2.7.3)
• Python for you and me (3.x)
• Python Idioms (PDF)
• Python in Education (Just fill the fields with any values)
• Python in Hydrology - Sat Kumar Tomer
• Python Koans (2.7 or 3.x)
• Python Module of the Week (3.x)
  • Python Module of the Week (2.x)
• Python Notes for Professionals - Compiled from StackOverflow documentation (3.x)
• Python Practice Book (2.7.1)
• Python Practice Projects
• Python Programming (PDF) (2.6)
• Scipy Lecture Notes
• SICP in Python (3.2)
• Snake Wrangling For Kids (3.x)
• Suporting Python 3: An In-Depth Guide (2.6 - 2.x & 3.1 - 3.x)
• Test-Driven Web Development with Python (3.3 - 3.x)
• Text Processing in Python - David Mertz (2.3 - 2.x)
• The Coder's Apprentice: Learning Programming with Python 3 - Pieter Spronck (PDF) (3.x)
• The Definitive Guide to Jython, Python for the Java Platform - Josh Juneau, Jim Baker, Victor Ng, Leo Soto, Frank Wierzbicki (2.5)
• The Little Book of Python Anti-Patterns (Source)
• The Programming Historian - William J. Turkel, Adam Crymble and Alan MacEachern
• The Python Ecosystem: An Introduction
• The Python GTK+ 3 Tutorial
• The Standard Python Library - Fredrik Lundh
• Think Complexity - Allen B. Downey (2nd Edition) (PDF, HTML)
• Web2py: Complete Reference Manual, 6th Edition (pre-release) (2.5 - 2.x)
• Wikibooks: Python Programming (2.7)

In this tutorial series article, I will explore features and packages of python which are widely used in the big data, NGS, and bioinformatics. I will also walk through a real biological example which shows NGS data processing with the help of python packages and programming.

Python has a couple of points to recommend it to biologists and scientists specifically:

• It's widely used in the scientific community
• It has a couple of very well designed libraries for doing complex scientific computing (although we won't encounter them in this book)
• It lend itself well to being integrated with other, existing tools
• It has features which make it easy to manipulate strings of characters (for example, strings of DNA bases and protein amino acid residues, which we as biologists are particularly fond of)

In general, following are some of the important features of python which makes it a perfect fit for rapid application development.

• Python is interpreted language so the program does not need to be compiled. Interpreter parses the program code and generates the output.
• Python is dynamically typed, so the variables types are defined automatically.
• Python is strongly typed. So the developers need to cast the type manually.
• Less code and more use makes it more acceptable.
• Python is portable, extendable and scalable.

There are two major Python versions, Python 2 and Python 3. Python 2 and 3 are quite different. This tutorial uses Python 3, because it more semantically correct and supports newer features.

I will post tutorial on daily basis on this page. Check the sub-pages on right side.

Read more: https://edu.t-bio.info/amity-university-summer-bioinformatics-program-registrations-are-open/

https://bioinformatics.kmutt.ac.th/about.html

Duangrudee Tanramluk (Ajarn Wi) uses computational biology and machine learning to tackle the key to drug design problems via MANORAA webserver.

https://mb.mahidol.ac.th/en/bioinformatics/

https://graduate.mahidol.ac.th/inter/

This international Doctorate programme is designed to further broaden students’ knowledge in Bioinformatics and Molecular Biology to their maximum capability. 

http://www.mbb.psu.ac.th/programmes/phd

Ph.D. program in Bioinformatics and Computational Biology is a joint effort of the Faculty of Science and Faculty of Medicine, Chulalongkorn University. The program has study plans for both applicants who hold a bachelor’s degree and applicants who hold a master’s degree in any related fields of study.

http://www.bioinfo.sc.chula.ac.th/ph-d-program-specialization/

Additional detail 

https://www.biotec.or.th/en/index.php/research/research-units/genome-technology-research-unit

https://tbrcnetwork.org/labtbrc/index.php/bioinformatics-and-chemoinformatics/

https://genomicsthailand.com/Genomic/home

Address of the bookmark: https://bioinformatics.kmutt.ac.th/

Live online courses on statistics with R based on this book, led by the author, are offered regularly; see this page for more information and dates.

The past decades have transformed the world of statistical data analysis, with new methods, new types of data, and new computational tools. The aim of Modern Statistics with R is to introduce you to key parts of the modern statistical toolkit. It teaches you:

• Data wrangling - importing, formatting, reshaping, merging, and filtering data in R.
• Exploratory data analysis - using visualisations and multivariate techniques to explore datasets.
• Statistical inference - modern methods for testing hypotheses and computing confidence intervals.
• Predictive modelling - regression models and machine learning methods for prediction, classification, and forecasting.
• Simulation - using simulation techniques for sample size computations and evaluations of statistical methods.
• Ethics in statistics - ethical issues and good statistical practice.
• R programming - writing code that is fast, readable, and (hopefully!) free from bugs.

The book includes plenty of examples and more than 200 exercises with worked solutions. The datasets used for the examples and the exercises can be downloaded here.

Address of the bookmark: https://www.modernstatisticswithr.com/

Why use AWK instead of Perl? Readability. AWK is easier to read than Perl. For simple text-processing scripts, particularly ones that read files line by line and split on delimiters, AWK is probably the right tool for the job.

#!/usr/bin/awk -f

# Comments are like this


# AWK programs consist of a collection of patterns and actions.
pattern1 { action; } # just like lex
pattern2 { action; }

# There is an implied loop and AWK automatically reads and parses each
# record of each file supplied. Each record is split by the FS delimiter,
# which defaults to white-space (multiple spaces,tabs count as one)
# You can assign FS either on the command line (-F C) or in your BEGIN
# pattern

# One of the special patterns is BEGIN. The BEGIN pattern is true
# BEFORE any of the files are read. The END pattern is true after
# an End-of-file from the last file (or standard-in if no files specified)
# There is also an output field separator (OFS) that you can assign, which
# defaults to a single space

BEGIN {

    # BEGIN will run at the beginning of the program. It's where you put all
    # the preliminary set-up code, before you process any text files. If you
    # have no text files, then think of BEGIN as the main entry point.

    # Variables are global. Just set them or use them, no need to declare..
    count = 0;

    # Operators just like in C and friends
    a = count + 1;
    b = count - 1;
    c = count * 1;
    d = count / 1; # integer division
    e = count % 1; # modulus
    f = count ^ 1; # exponentiation

    a += 1;
    b -= 1;
    c *= 1;
    d /= 1;
    e %= 1;
    f ^= 1;

    # Incrementing and decrementing by one
    a++;
    b--;

    # As a prefix operator, it returns the incremented value
    ++a;
    --b;

    # Notice, also, no punctuation such as semicolons to terminate statements

    # Control statements
    if (count == 0)
        print "Starting with count of 0";
    else
        print "Huh?";

    # Or you could use the ternary operator
    print (count == 0) ? "Starting with count of 0" : "Huh?";

    # Blocks consisting of multiple lines use braces
    while (a < 10) {
        print "String concatenation is done" " with a series" " of"
            " space-separated strings";
        print a;

        a++;
    }

    for (i = 0; i < 10; i++)
        print "Good ol' for loop";

    # As for comparisons, they're the standards:
    # a < b   # Less than
    # a <= b  # Less than or equal
    # a != b  # Not equal
    # a == b  # Equal
    # a > b   # Greater than
    # a >= b  # Greater than or equal

    # Logical operators as well
    # a && b  # AND
    # a || b  # OR

    # In addition, there's the super useful regular expression match
    if ("foo" ~ "^fo+$")
        print "Fooey!";
    if ("boo" !~ "^fo+$")
        print "Boo!";

    # Arrays
    arr[0] = "foo";
    arr[1] = "bar";

    # You can also initialize an array with the built-in function split()

    n = split("foo:bar:baz", arr, ":");

    # You also have associative arrays (actually, they're all associative arrays)
    assoc["foo"] = "bar";
    assoc["bar"] = "baz";

    # And multi-dimensional arrays, with some limitations I won't mention here
    multidim[0,0] = "foo";
    multidim[0,1] = "bar";
    multidim[1,0] = "baz";
    multidim[1,1] = "boo";

    # You can test for array membership
    if ("foo" in assoc)
        print "Fooey!";

    # You can also use the 'in' operator to traverse the keys of an array
    for (key in assoc)
        print assoc[key];

    # The command line is in a special array called ARGV
    for (argnum in ARGV)
        print ARGV[argnum];

    # You can remove elements of an array
    # This is particularly useful to prevent AWK from assuming the arguments
    # are files for it to process
    delete ARGV[1];

    # The number of command line arguments is in a variable called ARGC
    print ARGC;

    # AWK has several built-in functions. They fall into three categories. I'll
    # demonstrate each of them in their own functions, defined later.

    return_value = arithmetic_functions(a, b, c);
    string_functions();
    io_functions();
}

# Here's how you define a function
function arithmetic_functions(a, b, c,     d) {

    # Probably the most annoying part of AWK is that there are no local
    # variables. Everything is global. For short scripts, this is fine, even
    # useful, but for longer scripts, this can be a problem.

    # There is a work-around (ahem, hack). Function arguments are local to the
    # function, and AWK allows you to define more function arguments than it
    # needs. So just stick local variable in the function declaration, like I
    # did above. As a convention, stick in some extra whitespace to distinguish
    # between actual function parameters and local variables. In this example,
    # a, b, and c are actual parameters, while d is merely a local variable.

    # Now, to demonstrate the arithmetic functions

    # Most AWK implementations have some standard trig functions
    localvar = sin(a);
    localvar = cos(a);
    localvar = atan2(b, a); # arc tangent of b / a

    # And logarithmic stuff
    localvar = exp(a);
    localvar = log(a);

    # Square root
    localvar = sqrt(a);

    # Truncate floating point to integer
    localvar = int(5.34); # localvar => 5

    # Random numbers
    srand(); # Supply a seed as an argument. By default, it uses the time of day
    localvar = rand(); # Random number between 0 and 1.

    # Here's how to return a value
    return localvar;
}

function string_functions(    localvar, arr) {

    # AWK, being a string-processing language, has several string-related
    # functions, many of which rely heavily on regular expressions.

    # Search and replace, first instance (sub) or all instances (gsub)
    # Both return number of matches replaced
    localvar = "fooooobar";
    sub("fo+", "Meet me at the ", localvar); # localvar => "Meet me at the bar"
    gsub("e+", ".", localvar); # localvar => "m..t m. at th. bar"

    # Search for a string that matches a regular expression
    # index() does the same thing, but doesn't allow a regular expression
    match(localvar, "t"); # => 4, since the 't' is the fourth character

    # Split on a delimiter
    n = split("foo-bar-baz", arr, "-"); # a[1] = "foo"; a[2] = "bar"; a[3] = "baz"; n = 3

    # Other useful stuff
    sprintf("%s %d %d %d", "Testing", 1, 2, 3); # => "Testing 1 2 3"
    substr("foobar", 2, 3); # => "oob"
    substr("foobar", 4); # => "bar"
    length("foo"); # => 3
    tolower("FOO"); # => "foo"
    toupper("foo"); # => "FOO"
}

function io_functions(    localvar) {

    # You've already seen print
    print "Hello world";

    # There's also printf
    printf("%s %d %d %d\n", "Testing", 1, 2, 3);

    # AWK doesn't have file handles, per se. It will automatically open a file
    # handle for you when you use something that needs one. The string you used
    # for this can be treated as a file handle, for purposes of I/O. This makes
    # it feel sort of like shell scripting, but to get the same output, the string
    # must match exactly, so use a variable:

    outfile = "/tmp/foobar.txt";

    print "foobar" > outfile;

    # Now the string outfile is a file handle. You can close it:
    close(outfile);

    # Here's how you run something in the shell
    system("echo foobar"); # => prints foobar

    # Reads a line from standard input and stores in localvar
    getline localvar;

    # Reads a line from a pipe (again, use a string so you close it properly)
    cmd = "echo foobar";
    cmd | getline localvar; # localvar => "foobar"
    close(cmd);

    # Reads a line from a file and stores in localvar
    infile = "/tmp/foobar.txt";
    getline localvar < infile; 
    close(infile);
}

# As I said at the beginning, AWK programs consist of a collection of patterns
# and actions. You've already seen the BEGIN pattern. Other
# patterns are used only if you're processing lines from files or standard
# input.
#
# When you pass arguments to AWK, they are treated as file names to process.
# It will process them all, in order. Think of it like an implicit for loop,
# iterating over the lines in these files. these patterns and actions are like
# switch statements inside the loop. 

/^fo+bar$/ {

    # This action will execute for every line that matches the regular
    # expression, /^fo+bar$/, and will be skipped for any line that fails to
    # match it. Let's just print the line:

    print;

    # Whoa, no argument! That's because print has a default argument: $0.
    # $0 is the name of the current line being processed. It is created
    # automatically for you.

    # You can probably guess there are other $ variables. Every line is
    # implicitly split before every action is called, much like the shell
    # does. And, like the shell, each field can be access with a dollar sign

    # This will print the second and fourth fields in the line
    print $2, $4;

    # AWK automatically defines many other variables to help you inspect and
    # process each line. The most important one is NF

    # Prints the number of fields on this line
    print NF;

    # Print the last field on this line
    print $NF;
}

# Every pattern is actually a true/false test. The regular expression in the
# last pattern is also a true/false test, but part of it was hidden. If you
# don't give it a string to test, it will assume $0, the line that it's
# currently processing. Thus, the complete version of it is this:

$0 ~ /^fo+bar$/ {
    print "Equivalent to the last pattern";
}

a > 0 {
    # This will execute once for each line, as long as a is positive
}

# You get the idea. Processing text files, reading in a line at a time, and
# doing something with it, particularly splitting on a delimiter, is so common
# in UNIX that AWK is a scripting language that does all of it for you, without
# you needing to ask. All you have to do is write the patterns and actions
# based on what you expect of the input, and what you want to do with it.

# Here's a quick example of a simple script, the sort of thing AWK is perfect
# for. It will read a name from standard input and then will print the average
# age of everyone with that first name. Let's say you supply as an argument the
# name of a this data file:
#
# Bob Jones 32
# Jane Doe 22
# Steve Stevens 83
# Bob Smith 29
# Bob Barker 72
#
# Here's the script:

BEGIN {

    # First, ask the user for the name
    print "What name would you like the average age for?";

    # Get a line from standard input, not from files on the command line
    getline name < "/dev/stdin";
}

# Now, match every line whose first field is the given name
$1 == name {

    # Inside here, we have access to a number of useful variables, already
    # pre-loaded for us:
    # $0 is the entire line
    # $3 is the third field, the age, which is what we're interested in here
    # NF is the number of fields, which should be 3
    # NR is the number of records (lines) seen so far
    # FILENAME is the name of the file being processed
    # FS is the field separator being used, which is " " here
    # ...etc. There are plenty more, documented in the man page.

    # Keep track of a running total and how many lines matched
    sum += $3;
    nlines++;
}

# Another special pattern is called END. It will run after processing all the
# text files. Unlike BEGIN, it will only run if you've given it input to
# process. It will run after all the files have been read and processed
# according to the rules and actions you've provided. The purpose of it is
# usually to output some kind of final report, or do something with the
# aggregate of the data you've accumulated over the course of the script.

END {
    if (nlines)
        print "The average age for " name " is " sum / nlines;
}

De Bruijn Graphs for NGS Assembly
Algorithms for PacBio Reads
Software and Hardware Concepts for Bioinformatics
Finding us in Homolog.us (Search Algorithms)
NGS Genome and RNAseq Assembly - a Hands on Primer
Introduction to PERL, Python, R and C/C++ for Bioinformatics

Address of the bookmark: http://www.homolog.us/Tutorials/

If you currently use a spreadsheet like Microsoft Excel for data analysis, you might be interested in taking a look at this tutorial on how to transition from Excel to R by Tony Ojeda. The tutorial explains how to use R functions in place of Excel formulas, including tools like =AVERAGE and =VLOOKUP. For the most part, it uses modern R packages to keep the R code clear and concise.

You'll likely still be using Excel as a data source, though, so you'll also want to check out this guide to importing data from Excel to R from MilanoR.

Reference http://www.r-bloggers.com/an-r-tutorial-for-microsoft-excel-users/