Vladimir Dancik
Research Fellow
SLOVAK ACADEMY OF SCIENCES
MATHEMATICAL INSTITUTE
EXTENSION IN KOSICE
ADDRESS:
Mathematical Institute (MU SAV)
Slovak Academy of Sciences
Gresakova 6
040 01 Kosice
Slovak Republic
PHONE:
(+421) (95) 6228291
FAX:
(+421) (95) 6228291
EMAIL:
dancik@turing.upjs.sk
Education
RNDr (M.S.)
Mathematics
,
Safarik University
,
Kosice
,
Czecho

Slovakia
, 1988
Ph.D.
Computer Science
,
Warwick University
,
Coventry
,
United Kingdom
, 1994
Postdoctoral training
Computer Science
,
King's College London
,
London
,
United Kingdom
, 199495
Computational Biology
,
Mathematics
,
USC
,
Los Angeles
,
California
, 199597
Projects & Software
Alignment of Multiple Restriction Maps from Optical Mapping
Publications & Abstracts
Jae K. Lee, Vlado Dancik and Michael S. Waterman:
Estimation for Restriction Sites Observed by Optical Mapping Using Markov Chain Monte Carlo.
.
To appear in the Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB'98).
Vlado Dancik and Michael S. Waterman:
Simple Maximum Likelihood Methods for the Optical Mapping Problem
.
To appear in the Proceedings of the Workshop on Genome Informatics (GIW '97).
R. Agarwala, S. Batzoglou, V. Dancik, S. Decatur, S. Hannenhalli, M. Farach, S. Muthukrishnan, and S. Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in HP Model
.
Journal of Computational Biology,
4(1997):275296.
V. Dancik, S. Hannenhalli, and S. Muthukrishnan:
Hardness of FlipCut Problems from Optical Mapping
.
Journal of Computational Biology,
4(1997):119125.
V. Dancik:
Complexity of Boolean functions over bases with unbounded fanin gates
.
Information Processing Letters
57(1996):3134.
V. Dancik and M. S. Paterson:
Upper bounds for the expected length of a longest common subsequence of two binary sequences
.
Random Structures and Algorithms
6(1995):449458.
V. Dancik:
Common subsequences and supersequences and their expected length
.
Proceedings of 6th Annual Symposium Combinatorial Pattern Matching, Lecture Notes in Computer Science
937(1995):5563.
V. Dancik:
Expected Length of Longest Common Subsequences
.
Ph.D. Thesis, University of Warwick
, 1994
M. S. Paterson and V. Dancik:
Longest common subsequences
.
Proceedings of 19th International Symposium Mathematical Foundations of Computer Science, Lecture Notes in Computer Science
841(1994):127142.
V. Dancik:
Upper bounds for the expected length of a longest common subsequence
.
Bulletin of EATCS
54(1994):248, (abstract).
V. Dancik:
Lower bounds for complexity of product of linear combinations
.
Computers and Artificial Intelligence
9(1990):611614.