Does Israel Follow the Law? A Critical Analysis of Israel's Application of the International Law of Belligerent Occupation in the Occupied Territories

Israel's occupation of territories it captured in 1967 has become one of the longest and most controversial occupations of the last fifty years. Eschewing the traditional political analysis of the Israeli-Palestinian conflict, this paper aims to explore whether Israel has adequately applied international law in the occupied territories, in particular, the law of belligerent occupation. The two actors under assessment are the Israeli government, particularly its military which enforces and maintains the law in the territories, and the Supreme Court of Israel, which has the power of review over military actions in the territories. The particular issues of the occupation that are critically analyzed are the general legal framework that Israel established in the territories, Israel's civilian settlement policy in territories, and Israel's construction of a barrier in the West Bank. This paper concludes that Israel has incorrectly applied the legal framework of belligerent occupation by refusing to apply the Fourth Geneva Convention; it has wrongly concluded that the establishment of civilian settlements in the territories conform with international law; yet it has rightly concluded that the construction of the barrier in the West Bank is permissible under international law, in contrast to the conclusion of the much publicized International Court of Justice's Advisory Opinion on the 'Wall.' Along with these general assessments, the author will also provide some historical and political insight into why the Israeli government and the Supreme Court may have applied the law in the way that they did.

Utilization of Probabilistic Models in Short Read Assembly from Second-Generation Sequencing

With the advent of cheaper and faster DNA sequencing technologies, assembly methods have greatly changed. Instead of outputting reads that are thousands of base pairs long, new sequencers parallelize the task by producing read lengths between 35 and 400 base pairs. Reconstructing an organism’s genome from these millions of reads is a computationally expensive task. Our algorithm solves this problem by organizing and indexing the reads using n-grams, which are short, fixed-length DNA sequences of length n. These n-grams are used to efficiently locate putative read joins, thereby eliminating the need to perform an exhaustive search over all possible read pairs. Our goal was develop a novel n-gram method for the assembly of genomes from next-generation sequencers. Specifically, a probabilistic, iterative approach was utilized to determine the most likely reads to join through development of a new metric that models the probability of any two arbitrary reads being joined together. Tests were run using simulated short read data based on randomly created genomes ranging in lengths from 10,000 to 100,000 nucleotides with 16 to 20x coverage. We were able to successfully re-assemble entire genomes up to 100,000 nucleotides in length.