Michal Ziv-Ukelson

	2009
30		Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson: Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262
29		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)
28		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)
	2008
27		Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-Ukelson: Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243
26		Michal Ziv-Ukelson, Irit Gat-Viks, Ydo Wexler, Ron Shamir: A Faster Algorithm for RNA Co-folding. WABI 2008: 174-185
25		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)
24		Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate labelled subtree homeomorphism. J. Discrete Algorithms 6(3): 480-496 (2008)
	2007
23		Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15
22		Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson: Seeded Tree Alignment and Planar Tanglegram Layout. WABI 2007: 98-110
21		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)
20		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)
19		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)
	2006
18		Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter: On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. CPM 2006: 141-152
17		Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Ziv-Ukelson: A Study of Accessible Motifs and RNA Folding Complexity. RECOMB 2006: 473-487
16		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)
15		Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. Journal of Computational Biology 13(5): 1013-1027 (2006)
14		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)
	2005
13		Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson: On the Complexity of Sparse Exon Assembly. CPM 2005: 201-218
12		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
11		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
10		Ron Y. Pinter, Oleg Rokhlenko, Esti Yeger Lotem, Michal Ziv-Ukelson: Alignment of metabolic pathways. Bioinformatics 21(16): 3401-3408 (2005)
	2004
9		Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson: Two Algorithms for LCS Consecutive Suffix Alignment. CPM 2004: 173-193
8		Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson: Approximate Labelled Subtree Homeomorphism. CPM 2004: 59-73
	2003
7		Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. CPM 2003: 225-236
6		Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson: Sparse LCS Common Substring Alignment. Inf. Process. Lett. 88(6): 259-270 (2003)
5		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)
	2002
4		Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SODA 2002: 679-688
	2001
3		Gad M. Landau, Michal Ziv-Ukelson: On the Common Substring Alignment Problem. J. Algorithms 41(2): 338-359 (2001)
	2000
2		Gad 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

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

Colors in the list of coauthors