default search action
Vlado Dancík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i1]Deepak R. Unni, Sierra A. T. Moxon, Michael Bada, Matthew H. Brush, Richard M. Bruskiewich, Paul A. Clemons, Vlado Dancík, Michel Dumontier, Karamarie Fecho, Gustavo Glusman
, Jennifer J. Hadlock, Nomi L. Harris
Biolink Model: A Universal Schema for Knowledge Graphs in Clinical, Biomedical, and Translational Science. CoRR abs/2203.13906 (2022)
2010 – 2019
- 2017
- [j10]Bülent Arman Aksoy, Vlado Dancík, Kenneth Smith, Jessica N. Mazerik, Zhou Ji, Benjamin E. Gross, Olga Nikolova, Nadia Jaber, Andrea Califano
CTD2 Dashboard: a searchable web interface to connect validated results from the Cancer Target Discovery and Development Network. Database J. Biol. Databases Curation 2017: bax054 (2017)
2000 – 2009
- 2007
- [c10]Joël R. Pradines, Vlado Dancík, Alan Ruttenberg
Connectedness Profiles in Protein Networks for the Analysis of Gene Expression Data. RECOMB 2007: 296-310 - 2005
- [j9]Joël R. Pradines, Victor Farutin, Steve Rowley, Vlado Dancík:
Analyzing Protein Lists with Large Networks: Edge-Count Probabilities in Random Graphs with Given Expected Degrees. J. Comput. Biol. 12(2): 113-128 (2005) - 2000
- [j8]Pavel A. Pevzner, Vlado Dancík, Chris L. Tang:
Mutation-Tolerant Protein Identification by Mass Spectrometry. J. Comput. Biol. 7(6): 777-787 (2000) - [c9]Pavel A. Pevzner, Vlado Dancík, Chris L. Tang:
Mutation-tolerant protein identification by mass-spectrometry. RECOMB 2000: 231-236
1990 – 1999
- 1999
- [j7]Vlado Dancík, Theresa A. Addona, Karl R. Clauser
De Novo Peptide Sequencing via Tandem Mass Spectrometry. J. Comput. Biol. 6(3/4): 327-342 (1999) - [c8]Vlado Dancík, Theresa A. Addona, Karl R. Clauser, James E. Vath:
De Novo peptide sequencing via tandem mass spectrometry: a graph-theoretical approach. RECOMB 1999: 135-144 - 1998
- [j6]Vlado Dancík:
Common Subsequences and Supersequences and their Expected Length. Comb. Probab. Comput. 7(4): 365-373 (1998) - [j5]Jae Kyu Lee, Vlado Dancík, Michael S. Waterman:
Estimation for Restriction Sites Observed by Optical Mapping Using Reversible-Jump Markov Chain Monte Carlo. J. Comput. Biol. 5(3): 505-515 (1998) - [c7]Jae Kyu Lee, Vlado Dancík, Michael S. Waterman:
Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo. RECOMB 1998: 147-152 - 1997
- [j4]Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan:
Hardness of Flip-Cut Problems from Optical Mapping. J. Comput. Biol. 4(2): 119-125 (1997) - [j3]Richa Agarwala
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. J. Comput. Biol. 4(3): 275-296 (1997) - [c6]Richa Agarwala
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. RECOMB 1997: 1-2 - [c5]Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan:
Hardness of flip-cut problems from optical mapping [DNA molecules application]. SEQUENCES 1997: 275-284 - [c4]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. SODA 1997: 390-399 - 1996
- [j2]Vlado Dancík:
Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates. Inf. Process. Lett. 57(1): 31-34 (1996) - 1995
- [j1]Vlado Dancík, Mike Paterson:
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. Random Struct. Algorithms 6(4): 449-458 (1995) - [c3]Vlado Dancík:
Common Subsequences and Supersequences and Their expected Length. CPM 1995: 55-63 - 1994
- [c2]Mike Paterson, Vlado Dancík:
Longest Common Subsequences. MFCS 1994: 127-142 - [c1]Vlado Dancík, Mike Paterson:
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. STACS 1994: 669-678
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: