Algorithms in

Algorithms in

Computational

Computational

Genomics

Genomics

at TAU

at TAU

We develop algorithms and tools for analysis of
genomic and systems biology data. Areas include:

June 2017: Reconstructing cancer karyotypes

Read Rami Eitan's paper on reconstructing cancer karyotypes from short read data on BioRxiv

May 2017: Roye Rozov wins the Deutsch Excellence Scholarship

Congratulations to Roye Rozov for being awarded the Deutsch Excellence Scholarship for PhD students in the School of Computer Science, TAU. The awarding ceremony will take place on Thursday May 18, at 15:15, in the Open Space Lab in the School of Computer Science.

April 2017: Gene expression buffered on the protein level

Read Kobi Perl's paper on the connection between the transcriptome and proteome in non-proliferating tissues.

April 2017: Sleep and brain modularity

Read Adi's paper with colleagues from Talma Hendler's group showing that sleep deprivation leads to deterioration in the modularity of the brain.

March 2017: Farewell to Didi!

Didi Amar has left the group for a postdoc in Stanford. Didi has been a leader in the group for a long time - as a master, doctoral and postdoctoral student. We wish him great success in the next steps.

March 2017: Faucet accepted to RECOMB-seq

Roye Rozov's new paper "Faucet: streaming de novo assembly graph construction" was accepted to RECOMB-seq 2017 and will be presented in Hong Kong in May.

March 2017: Minimizers paper accepted to ISMB

David Pellow's paper on improving the performance of minimizers, with Y. Oresntein and C. Kingsford's team, has been accepted to ISMB 2017 and will be presented in Prague in July.

February 2017: The interplay of DNA sequence and shape in regulatory motifs

Read our new paper in Molecular Systems Biology in collaboration with Rohs and Taipale groups analyzing shape readout for over 400 transcription factors using HT-Selex data.

February 2017: Welcome to Nimrod Rapoport

We welcome Nimrod who is joining the group as an MSc student, after a BSc in Computer Science from TAU.

January 2017: New analysis of minimizers and universal hitting sets

Read our new report with colleagues from MIT and CMU on the properties of minimizers using lexicographic, random k-mer ordering and small universal hitting sets. Our analysis shows how to significantly improve the performance of minimizers.
Ron-Shamir

Prof. Ron Shamir

ExpanderArtboard 1@3x-8

Expander

shamir-iconArtboard 11

Adeptus

MatisseArtboard 1@3x-8

Matisse

2Artboard 1@3x-8

Morph

Shamir-Icon-AmadeusArtboard 11

Amadeus

TwigArtboard 1@3x-8

TWIGS

Recycler-iconArtboard 1

Recycler

ArrowArtboard 1@4x-8

All projects