Tzvika Hartman

According to our database1, Tzvika Hartman authored at least 20 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Customization scenarios for de-identification of clinical notes.
BMC Medical Informatics Decis. Mak., 2020

Active deep learning to detect demographic traits in free-form clinical notes.
J. Biomed. Informatics, 2020

2019
A Joint Named-Entity Recognizer for Heterogeneous Tag-setsUsing a Tag Hierarchy.
CoRR, 2019

Audio De-identification - a New Entity Recognition Task.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

A Joint Named-Entity Recognizer for Heterogeneous Tag-sets Using a Tag Hierarchy.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2012
How to split a flow?
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

2009
On the Cost of Interchange Rearrangement in Strings.
SIAM J. Comput., 2009

On the complexity of SNP block partitioning under the perfect phylogeny model.
Discret. Math., 2009

2008
Generalized LCS.
Theor. Comput. Sci., 2008

2006
A 1.375-Approximation Algorithm for Sorting by Transpositions.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

A simpler and faster 1.5-approximation algorithm for sorting by transpositions.
Inf. Comput., 2006

Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions.
Proceedings of the String Processing and Information Retrieval, 2006

2005
A 1.5-approximation algorithm for sorting by transpositions and transreversals.
J. Comput. Syst. Sci., 2005

2004
Towards Optimally Multiplexed Applications of Universal Arrays.
J. Comput. Biol., 2004

2003
On the distribution of the number of roots of polynomials and explicit weak designs.
Random Struct. Algorithms, 2003

Handling Long Targets and Errors in Sequencing by Hybridization.
J. Comput. Biol., 2003

Towards optimally multiplexed applications of universal DNA tag systems.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2000
On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors
Electron. Colloquium Comput. Complex., 2000


  Loading...