Publication Details
Constructing Phylogenetic Trees Based on Intra-Group Analysis of Human Mitochondrial DNA
VOGEL, I.; ZEDEK, F.; OČENÁŠEK, P. Constructing Phylogenetic Trees Based on Intra-Group Analysis of Human Mitochondrial DNA. In Human Interface and the Management of Information. Interacting with Information. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2011. p. 165-169. ISBN: 978-3-642-21792-0. ISSN: 0302-9743.
Czech title
Konstrukce fylogenetických stromů na bázi vnitroskupinové analýzy lidské mitochondriální DNA
Type
conference paper
Language
English
Authors
Keywords
intra-group analysis, substitution model, position-specific clustering vector, mtDNA, population divergence, phylogenetic tree, neighbor joining
Abstract
This paper describes a modified algorithm for inferring phylogenetic trees based on distance techniques. The input of the algorithm consists of predefined clusters of data. It uses a usual agglomerative approach, however it involves a novel technique for distance matrix creation as the task of clustering predefined groups of human mitochondrial DNA sequences should be fulfilled.
Published
2011
Pages
165–169
Journal
Lecture Notes in Computer Science, vol. 6771, no. 1, ISSN 0302-9743
Proceedings
Human Interface and the Management of Information. Interacting with Information
Series
Lecture Notes in Computer Science
ISBN
978-3-642-21792-0
Publisher
Springer Verlag
Place
Berlin Heidelberg
DOI
EID Scopus
BibTeX
@inproceedings{BUT76261,
author="Ivan {Vogel} and František {Zedek} and Pavel {Očenášek}",
title="Constructing Phylogenetic Trees Based on Intra-Group Analysis of Human Mitochondrial DNA",
booktitle="Human Interface and the Management of Information. Interacting with Information",
year="2011",
series="Lecture Notes in Computer Science",
journal="Lecture Notes in Computer Science",
volume="6771",
number="1",
pages="165--169",
publisher="Springer Verlag",
address="Berlin Heidelberg",
doi="10.1007/978-3-642-21793-7\{_}20",
isbn="978-3-642-21792-0",
issn="0302-9743"
}