Kamil Khanipov

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Maria Pimenova

> Home > Persons > Kamil Khanipov

Publications

2017
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/bibe/KhanipovAGPPFK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bibe/KhanipovAGPPFK17
Kamil Khanipov, Levent Albayrak, George Golovko, Maria Pimenova, Ioannis T. Pavlidis, Yuriy Fofanov, Khanipov K.:
Novel Computational Approach for Identification of Highly Mutated Integrated HIV Genomes. BIBE 2017: 246-248
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/bibe/AlbayrakKRGPKF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bibe/AlbayrakKRGPKF17
Levent L. Albayrak, Kamil Khanipov, Mark Rojas, George Golovko, Maria Pimenova, Michael Kosoy, Yuriy Fofanov:
Exploration of Natural Alignment Scoring Rules and Clustering Thresholds for Bacterial Core/Pan Genome Analysis. BIBE 2017: 249-254
2015
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/bibm/KhanipovGRADPOC15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bibm/KhanipovGRADPOC15
Kamil Khanipov, Georgiy Golovko, Mark Rojas, Levent Albayrak, Otto Dobretsberger, Maria Pimenova, Nels Olson, Sergei Chumakov, Yuriy Fofanov:
CoCo: An application to store High-Throughput Sequencing data in compact text and binary file formats. BIBM 2015: 1117-1122

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.