Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michal Ziv-Ukelson
2010 – today
- 2013
[j24]Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson: Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms for Molecular Biology 8: 13 (2013)- [c23]Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson: Efficient All Path Score Computations on Grid Graphs. CPM 2013: 211-222
- 2012
- [j23]Isana Veksler-Lublinsky, Yonat Shemer-Avni, Eti Meiri, Zvi Bentwich, Klara Kedem, Michal Ziv-Ukelson: Finding quasi-modules of human and viral miRNAs: a case study of human cytomegalovirus (HCMV). BMC Bioinformatics 13: 322 (2012)
- [c22]Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson: RNA Tree Comparisons via Unrooted Unordered Alignments. WABI 2012: 135-148
- 2011
- [j22]Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms for Molecular Biology 6: 20 (2011)
- [j21]Kfir Wolfson, Shay Zakov, Moshe Sipper, Michal Ziv-Ukelson: Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis. Genetic Programming and Evolvable Machines 12(2): 121-160 (2011)
- [j20]Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson: Regular Language Constrained Sequence Alignment Revisited. Journal of Computational Biology 18(5): 771-781 (2011)
- [j19]Shay Zakov, Yoav Goldberg, Michael Elhadad, Michal Ziv-Ukelson: Rich Parameterization Improves RNA Structure Prediction. Journal of Computational Biology 18(11): 1525-1542 (2011)
- [j18]Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9(1): 12-31 (2011)
- [c21]Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Edit Distance with Duplications and Contractions Revisited. CPM 2011: 441-454
- [c20]Shay Zakov, Yoav Goldberg, Michael Elhadad, Michal Ziv-Ukelson: Rich Parameterization Improves RNA Structure Prediction. RECOMB 2011: 546-562
- 2010
- [j17]Isana Veksler-Lublinsky, Yonat Shemer-Avni, Klara Kedem, Michal Ziv-Ukelson: Gene bi-targeting by viral and human miRNAs. BMC Bioinformatics 11: 249 (2010)
- [j16]Michal Ziv-Ukelson, Irit Gat-Viks, Ydo Wexler, Ron Shamir: A Faster Algorithm for Simultaneous Alignment and Folding of RNA. Journal of Computational Biology 17(8): 1051-1065 (2010)
- [c19]Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson: Regular Language Constrained Sequence Alignment Revisited. IWOCA 2010: 404-415
- [c18]Nimrod Milo, Tamar Pinhas, Michal Ziv-Ukelson: SA-REPC - Sequence Alignment with Regular Expression Path Constraint. LATA 2010: 451-462
- [c17]Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson: Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI 2010: 65-77
2000 – 2009
- 2009
- [j15]Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009)
- [j14]Yair Horesh, Ydo Wexler, Ilana Lebenthal, Michal Ziv-Ukelson, Ron Unger: RNAslider: a faster engine for consecutive windows folding and its application to the analysis of genomic folding asymmetry. BMC Bioinformatics 10 (2009)
- [j13]Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009)
- [c16]Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262
- 2008
- [j12]Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008)
- [j11]Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 503-513 (2008)
- [c15]Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243
- [c14]Michal Ziv-Ukelson, Irit Gat-Viks, Ydo Wexler, Ron Shamir: A Faster Algorithm for RNA Co-folding. WABI 2008: 174-185
- 2007
- [j10]Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson: A Study of Accessible Motifs and RNA Folding Complexity. Journal of Computational Biology 14(6): 856-872 (2007)
- [j9]Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny Barash, Klara Kedem: A Structure-Based Flexible Search Method for Motifs in RNA. Journal of Computational Biology 14(7): 908-926 (2007)
- [j8]Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson: Two algorithms for LCS Consecutive Suffix Alignment. J. Comput. Syst. Sci. 73(7): 1095-1117 (2007)
- [c13]Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15
- [c12]Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110
- 2006
- [j7]Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson, Ron Y. Pinter, Zohar Yakhini: A High-Throughput Approach for Associating MicroRNAs with Their Activity Conditions. Journal of Computational Biology 13(2): 245-266 (2006)
- [j6]Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. Journal of Computational Biology 13(5): 1013-1027 (2006)
- [j5]Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. Journal of Computational Biology 13(8): 1397-1418 (2006)
- [c11]Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. CPM 2006: 141-152
- [c10]Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson: A Study of Accessible Motifs and RNA Folding Complexity. RECOMB 2006: 473-487
- 2005
- [j4]Ron Y. Pinter, Oleg Rokhlenko, Esti Yeger Lotem, Michal Ziv-Ukelson: Alignment of metabolic pathways. Bioinformatics 21(16): 3401-3408 (2005)
- [c9]Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. CPM 2005: 201-218
- [c8]Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson, Ron Y. Pinter, Zohar Yakhini: A High-Throughput Approach for Associating microRNAs with Their Activity Conditions. RECOMB 2005: 133-151
- [c7]Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson: Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression. WABI 2005: 13-26
- 2004
- [c6]Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73
- [c5]Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson: Two Algorithms for LCS Consecutive Suffix Alignment. CPM 2004: 173-193
- 2003
- [j3]Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. Inf. Process. Lett. 88(6): 259-270 (2003)
- [j2]Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM J. Comput. 32(6): 1654-1673 (2003)
- [c4]Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. CPM 2003: 225-236
- 2002
- [c3]Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA 2002: 679-688
- 2001
- [j1]Gad M. Landau, Michal Ziv-Ukelson: On the Common Substring Alignment Problem. J. Algorithms 41(2): 338-359 (2001)
- 2000
- [c2]
1990 – 1999
- 1998
- [c1]Michal Ziv-Ukelson, Aaron Kershenbaum: A Dictionary Matching Algorithm Fast on the Average for Terms of Varying Length. CPM 1998: 34-54
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-19 19:34 CEST by the dblp team