Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Dan{\v{c}}{\'{i}}k, Vlado"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connectedness profiles in protein networks for the analysis of gene expression data
Joël Pradines
,
Vlado Danc̑ík
,
Alan Ruttenberg
,
Victor Farutin
LNCS/LNBI
4453
, 2007, pp. 296-310
Mutation-tolerant protein identification by mass-spectrometry
Pavel A. Pevzner
,
Vlado Danc̑ík
,
Chris L. Tang
Proceedings of the 4th Annual International Conference on Computational Molecular Biology, RECOMB'2000 (Tokyo, Japan, April 8-11, 2000)
, 2000, pp. 231-236
De novo peptide sequencing via tandem mass spectrometry: A graph-theoretical approach
Vlado Danc̑ík
,
Theresa A. Addona
,
Karl R. Clauser
,
James E. Vath
,
Pavel A. Pevzner
Proceedings of the 3rd Annual International Conference on Computational Molecular Biology, RECOMB'99 (Lyon, France, April 11-14, 1999)
, 1999, pp. 135-144
Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo
Jae K. Lee
,
Vlado Danc̑ík
,
Michael S. Waterman
Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, RECOMB'98 (New York, New York, March 22-25, 1998)
, 1998, pp. 147-152
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model
Richa Agarwala
,
Serafim Batzoglou
,
Vlado Danc̑ík
,
Scott E. Decatur
,
Martin Farach
,
Sridhar Hannenhalli
,
S. Muthukrishnan
,
Steven Skiena
Proceedings of the 1st Annual International Conference on Computational Molecular Biology, RECOMB'97 (Santa Fe, New Mexico, January 20-23, 1997)
, 1997, pp. 1-2
Complexity of Boolean functions over bases with unbounded fan-in gates
Vlado Danc̑ík
Information Processing Letters
57
(1), 1996, pp. 31-34
Common subsequences and supersequences and their expected length
Vlado Danc̑ík
Lecture Notes in Computer Science
937
, 1995, pp. 55-63
Longest common subsequences
Mike Paterson
,
Vlado Danc̑ík
Lecture Notes in Computer Science
841
, 1994, pp. 127-142