Vlado Dancík

According to our database1, Vlado Dancík authored at least 16 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Biolink Model: A Universal Schema for Knowledge Graphs in Clinical, Biomedical, and Translational Science.
CoRR, 2022

2017
CTD2 Dashboard: a searchable web interface to connect validated results from the Cancer Target Discovery and Development Network.
Database J. Biol. Databases Curation, 2017

2007
Connectedness Profiles in Protein Networks for the Analysis of Gene Expression Data.
Proceedings of the Research in Computational Molecular Biology, 2007

2005
Analyzing Protein Lists with Large Networks: Edge-Count Probabilities in Random Graphs with Given Expected Degrees.
J. Comput. Biol., 2005

2000
Mutation-Tolerant Protein Identification by Mass Spectrometry.
J. Comput. Biol., 2000

1999
De Novo Peptide Sequencing via Tandem Mass Spectrometry.
J. Comput. Biol., 1999

De Novo peptide sequencing via tandem mass spectrometry: a graph-theoretical approach.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

1998
Estimation for Restriction Sites Observed by Optical Mapping Using Reversible-Jump Markov Chain Monte Carlo
J. Comput. Biol., 1998

Common Subsequences and Supersequences and their Expected Length.
Comb. Probab. Comput., 1998

1997
Hardness of Flip-Cut Problems from Optical Mapping.
J. Comput. Biol., 1997

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.
J. Comput. Biol., 1997

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Hardness of flip-cut problems from optical mapping [DNA molecules application].
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996
Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates.
Inf. Process. Lett., 1996

1995
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
Random Struct. Algorithms, 1995

1994
Longest Common Subsequences.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994


  Loading...