Eintrag weiter verarbeiten
Verfügbar über Online-Ressource

Probabilistic nucleotide assembling method for sequencing by hybridization

Gespeichert in:

Bibliographische Detailangaben
Zeitschriftentitel: Bioinformatics
Personen und Körperschaften: Endo, Takaho A.
In: Bioinformatics, 20, 2004, 14, S. 2181-2188
Format: E-Article
Sprache: Englisch
veröffentlicht:
Oxford University Press (OUP)
Schlagwörter:
Computational Mathematics
Computational Theory and Mathematics
Computer Science Applications
Molecular Biology
Biochemistry
Statistics and Probability
author_facet Endo, Takaho A.
Endo, Takaho A.
author Endo, Takaho A.
spellingShingle Endo, Takaho A.
Bioinformatics
Probabilistic nucleotide assembling method for sequencing by hybridization
Computational Mathematics
Computational Theory and Mathematics
Computer Science Applications
Molecular Biology
Biochemistry
Statistics and Probability
author_sort endo, takaho a.
spelling Endo, Takaho A. 1367-4811 1367-4803 Oxford University Press (OUP) Computational Mathematics Computational Theory and Mathematics Computer Science Applications Molecular Biology Biochemistry Statistics and Probability http://dx.doi.org/10.1093/bioinformatics/bth202 <jats:title>Abstract</jats:title> <jats:p>Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process.</jats:p> <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.</jats:p> <jats:p>Availability: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html</jats:p> Probabilistic nucleotide assembling method for sequencing by hybridization Bioinformatics
doi_str_mv 10.1093/bioinformatics/bth202
facet_avail Online
Free
finc_class_facet Mathematik
Informatik
Biologie
Chemie und Pharmazie
format ElectronicArticle
fullrecord blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTA5My9iaW9pbmZvcm1hdGljcy9idGgyMDI
id ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTA5My9iaW9pbmZvcm1hdGljcy9idGgyMDI
institution DE-Bn3
DE-Brt1
DE-Zwi2
DE-D161
DE-Gla1
DE-Zi4
DE-15
DE-Rs1
DE-Pl11
DE-105
DE-14
DE-Ch1
DE-L229
DE-D275
imprint Oxford University Press (OUP), 2004
imprint_str_mv Oxford University Press (OUP), 2004
issn 1367-4811
1367-4803
issn_str_mv 1367-4811
1367-4803
language English
mega_collection Oxford University Press (OUP) (CrossRef)
match_str endo2004probabilisticnucleotideassemblingmethodforsequencingbyhybridization
publishDateSort 2004
publisher Oxford University Press (OUP)
recordtype ai
record_format ai
series Bioinformatics
source_id 49
title Probabilistic nucleotide assembling method for sequencing by hybridization
title_unstemmed Probabilistic nucleotide assembling method for sequencing by hybridization
title_full Probabilistic nucleotide assembling method for sequencing by hybridization
title_fullStr Probabilistic nucleotide assembling method for sequencing by hybridization
title_full_unstemmed Probabilistic nucleotide assembling method for sequencing by hybridization
title_short Probabilistic nucleotide assembling method for sequencing by hybridization
title_sort probabilistic nucleotide assembling method for sequencing by hybridization
topic Computational Mathematics
Computational Theory and Mathematics
Computer Science Applications
Molecular Biology
Biochemistry
Statistics and Probability
url http://dx.doi.org/10.1093/bioinformatics/bth202
publishDate 2004
physical 2181-2188
description <jats:title>Abstract</jats:title> <jats:p>Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process.</jats:p> <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.</jats:p> <jats:p>Availability:  http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html</jats:p>
container_issue 14
container_start_page 2181
container_title Bioinformatics
container_volume 20
format_de105 Article, E-Article
format_de14 Article, E-Article
format_de15 Article, E-Article
format_de520 Article, E-Article
format_de540 Article, E-Article
format_dech1 Article, E-Article
format_ded117 Article, E-Article
format_degla1 E-Article
format_del152 Buch
format_del189 Article, E-Article
format_dezi4 Article
format_dezwi2 Article, E-Article
format_finc Article, E-Article
format_nrw Article, E-Article
_version_ 1792332950086352903
geogr_code not assigned
last_indexed 2024-03-01T14:04:58.79Z
geogr_code_person not assigned
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Probabilistic+nucleotide+assembling+method+for+sequencing+by+hybridization&rft.date=2004-09-22&genre=article&issn=1367-4803&volume=20&issue=14&spage=2181&epage=2188&pages=2181-2188&jtitle=Bioinformatics&atitle=Probabilistic+nucleotide+assembling+method+for+sequencing+by+hybridization&aulast=Endo&aufirst=Takaho+A.&rft_id=info%3Adoi%2F10.1093%2Fbioinformatics%2Fbth202&rft.language%5B0%5D=eng
SOLR
_version_ 1792332950086352903
author Endo, Takaho A.
author_facet Endo, Takaho A., Endo, Takaho A.
author_sort endo, takaho a.
container_issue 14
container_start_page 2181
container_title Bioinformatics
container_volume 20
description <jats:title>Abstract</jats:title> <jats:p>Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process.</jats:p> <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.</jats:p> <jats:p>Availability:  http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html</jats:p>
doi_str_mv 10.1093/bioinformatics/bth202
facet_avail Online, Free
finc_class_facet Mathematik, Informatik, Biologie, Chemie und Pharmazie
format ElectronicArticle
format_de105 Article, E-Article
format_de14 Article, E-Article
format_de15 Article, E-Article
format_de520 Article, E-Article
format_de540 Article, E-Article
format_dech1 Article, E-Article
format_ded117 Article, E-Article
format_degla1 E-Article
format_del152 Buch
format_del189 Article, E-Article
format_dezi4 Article
format_dezwi2 Article, E-Article
format_finc Article, E-Article
format_nrw Article, E-Article
geogr_code not assigned
geogr_code_person not assigned
id ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTA5My9iaW9pbmZvcm1hdGljcy9idGgyMDI
imprint Oxford University Press (OUP), 2004
imprint_str_mv Oxford University Press (OUP), 2004
institution DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Rs1, DE-Pl11, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275
issn 1367-4811, 1367-4803
issn_str_mv 1367-4811, 1367-4803
language English
last_indexed 2024-03-01T14:04:58.79Z
match_str endo2004probabilisticnucleotideassemblingmethodforsequencingbyhybridization
mega_collection Oxford University Press (OUP) (CrossRef)
physical 2181-2188
publishDate 2004
publishDateSort 2004
publisher Oxford University Press (OUP)
record_format ai
recordtype ai
series Bioinformatics
source_id 49
spelling Endo, Takaho A. 1367-4811 1367-4803 Oxford University Press (OUP) Computational Mathematics Computational Theory and Mathematics Computer Science Applications Molecular Biology Biochemistry Statistics and Probability http://dx.doi.org/10.1093/bioinformatics/bth202 <jats:title>Abstract</jats:title> <jats:p>Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process.</jats:p> <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.</jats:p> <jats:p>Availability: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html</jats:p> Probabilistic nucleotide assembling method for sequencing by hybridization Bioinformatics
spellingShingle Endo, Takaho A., Bioinformatics, Probabilistic nucleotide assembling method for sequencing by hybridization, Computational Mathematics, Computational Theory and Mathematics, Computer Science Applications, Molecular Biology, Biochemistry, Statistics and Probability
title Probabilistic nucleotide assembling method for sequencing by hybridization
title_full Probabilistic nucleotide assembling method for sequencing by hybridization
title_fullStr Probabilistic nucleotide assembling method for sequencing by hybridization
title_full_unstemmed Probabilistic nucleotide assembling method for sequencing by hybridization
title_short Probabilistic nucleotide assembling method for sequencing by hybridization
title_sort probabilistic nucleotide assembling method for sequencing by hybridization
title_unstemmed Probabilistic nucleotide assembling method for sequencing by hybridization
topic Computational Mathematics, Computational Theory and Mathematics, Computer Science Applications, Molecular Biology, Biochemistry, Statistics and Probability
url http://dx.doi.org/10.1093/bioinformatics/bth202