1 citations · 1 across the 2 of their papers we have counts for
4 papers
Learning of Structurally Unambiguous Probabilistic Grammars
Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estima…
Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees
G. R. Zimerman, D. Svetlitsky, M. Zehavi +1
We define a new problem in comparative genomics, denoted PQ-Tree Search, that takes as input a PQ-tree representing the known gene orders of a gene cluster of interest, a gene-…
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation
Roni Zoller, Meirav Zehavi, Michal Ziv-Ukelson
An important goal in microbial computational genomics is to identify crucial events in the evolution of a gene that severely alter the duplication, loss and mobilization patterns o…
Dynamic all scores matrices for LCS score
Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson
The problem of aligning two strings A,B in order to determine their similarity is fundamental in the field of pattern matching. An important concept in this domain is the "all scor…