Michal Ziv-Ukelson

From MaRDI portal
(Redirected from Person:396717)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
New algorithms for structure informed genome rearrangement2024-08-13Paper
Learning of Structurally Unambiguous Probabilistic Grammars
Logical Methods in Computer Science
2023-03-22Paper
Approximate search for known gene clusters in new genomes using PQ-trees2023-02-07Paper
scientific article; zbMATH DE number 7559171 (Why is no real title available?)2022-07-18Paper
On almost Monge all scores matrices
Algorithmica
2019-01-11Paper
A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands2018-03-23Paper
scientific article; zbMATH DE number 6792426 (Why is no real title available?)2017-10-17Paper
Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns
Lecture Notes in Computer Science
2017-07-25Paper
Algorithms for path-constrained sequence alignment
Journal of Discrete Algorithms
2014-08-13Paper
The Worst Case Complexity of Maximum Parsimony
Combinatorial Pattern Matching
2014-06-30Paper
Efficient all path score computations on grid graphs
Theoretical Computer Science
2014-03-13Paper
Efficient all path score computations on grid graphs
Combinatorial Pattern Matching
2013-06-14Paper
Edit distance with duplications and contractions revisited
Combinatorial Pattern Matching
2011-06-29Paper
Regular language constrained sequence alignment revisited
Lecture Notes in Computer Science
2011-05-19Paper
Sparse RNA folding: time and space efficient algorithms
Journal of Discrete Algorithms
2011-05-03Paper
SA-REPC -- sequence alignment with regular expression path constraint
Language and Automata Theory and Applications
2010-05-26Paper
Sparse LCS Common Substring Alignment
Combinatorial Pattern Matching
2010-04-06Paper
Fast algorithms for computing tree LCS
Theoretical Computer Science
2009-10-09Paper
Speeding up HMM decoding and training by exploiting sequence repetitions
Algorithmica
2009-08-27Paper
Sparse LCS common substring alignment
Information Processing Letters
2009-07-09Paper
Sparse RNA Folding: Time and Space Efficient Algorithms
Combinatorial Pattern Matching
2009-07-07Paper
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
2009-05-13Paper
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
Combinatorial Pattern Matching
2008-06-17Paper
Fast Algorithms for Computing Tree LCS
Combinatorial Pattern Matching
2008-06-17Paper
On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
Combinatorial Pattern Matching
2007-09-14Paper
A Study of Accessible Motifs and RNA Folding Complexity
Lecture Notes in Computer Science
2007-08-30Paper
Two algorithms for LCS consecutive suffix alignment
Journal of Computer and System Sciences
2007-08-27Paper
Combinatorial Pattern Matching
Lecture Notes in Computer Science
2005-12-14Paper
Research in Computational Molecular Biology
Lecture Notes in Computer Science
2005-11-23Paper
Combinatorial Pattern Matching
Lecture Notes in Computer Science
2005-09-07Paper
Combinatorial Pattern Matching
Lecture Notes in Computer Science
2005-09-07Paper
scientific article; zbMATH DE number 2119727 (Why is no real title available?)2004-11-29Paper
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
SIAM Journal on Computing
2004-01-08Paper
On the common substring alignment problem
Journal of Algorithms
2002-07-08Paper
scientific article; zbMATH DE number 1445380 (Why is no real title available?)2001-04-01Paper


Research outcomes over time


This page was built for person: Michal Ziv-Ukelson