dblp.uni-trier.dewww.uni-trier.de

Michal Ziv-Ukelson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
27EEShay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243
26EEMichal Ziv-Ukelson, Irit Gat-Viks, Ydo Wexler, Ron Shamir: A Faster Algorithm for RNA Co-folding. WABI 2008: 174-185
25EEAntoni 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)
24EERon Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008)
2007
23EEShay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15
22EEAntoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110
21EEGad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson: Two algorithms for LCS Consecutive Suffix Alignment. J. Comput. Syst. Sci. 73(7): 1095-1117 (2007)
20EEYdo 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)
19EEIsana 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)
2006
18EEFiras Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. CPM 2006: 141-152
17EEYdo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson: A Study of Accessible Motifs and RNA Folding Complexity. RECOMB 2006: 473-487
16EEChaya 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)
15EECarmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. Journal of Computational Biology 13(5): 1013-1027 (2006)
14EEFiras Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. Journal of Computational Biology 13(8): 1397-1418 (2006)
2005
13EECarmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. CPM 2005: 201-218
12EEChaya 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
11EEChaya 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
10EERon Y. Pinter, Oleg Rokhlenko, Esti Yeger Lotem, Michal Ziv-Ukelson: Alignment of metabolic pathways. Bioinformatics 21(16): 3401-3408 (2005)
2004
9EEGad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson: Two Algorithms for LCS Consecutive Suffix Alignment. CPM 2004: 173-193
8EERon Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73
2003
7EEGad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. CPM 2003: 225-236
6EEGad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. Inf. Process. Lett. 88(6): 259-270 (2003)
5EEMaxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. SIAM J. Comput. 32(6): 1654-1673 (2003)
2002
4EEMaxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA 2002: 679-688
2001
3EEGad M. Landau, Michal Ziv-Ukelson: On the Common Substring Alignment Problem. J. Algorithms 41(2): 338-359 (2001)
2000
2EEGad M. Landau, Michal Ziv-Ukelson: On the shared substring alignment problem. SODA 2000: 804-814
1998
1 Michal Ziv-Ukelson, Aaron Kershenbaum: A Dictionary Matching Algorithm Fast on the Average for Terms of Varying Length. CPM 1998: 34-54

Coauthor Index

1Danny Barash [19]
2Maxime Crochemore [4] [5]
3Irit Gat-Viks [26]
4Klara Kedem [19]
5Carmel Kent [13] [15]
6Aaron Kershenbaum [1]
7Gad M. Landau [2] [3] [4] [5] [6] [7] [9] [13] [15] [21]
8Esti Yeger Lotem [10]
9Antoni Lozano [22] [25]
10Shay Mozes [23] [27]
11Eugene W. Myers (Gene Myers) [9] [21]
12Ron Y. Pinter [8] [10] [12] [14] [16] [18] [22] [24] [25]
13Oleg Rokhlenko [8] [10] [22] [24] [25]
14Baruch Schieber [6] [7]
15Ron Shamir [26]
16Firas Swidan [14] [18]
17Dekel Tsur [8] [24] [27]
18Gabriel Valiente [22] [25]
19Isana Veksler-Lublinsky [19]
20Oren Weimann [23] [27]
21Ydo Wexler [17] [20] [26]
22Zohar Yakhini [12] [16]
23Chaya Ben-Zaken Zilberstein [11] [12] [16] [17] [20]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)