About: Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The paper presents a successful application of an evolutionary based iterative optimization method called Prototype Optimization with Evolved Improvement Steps (POEMS) to the DNA fragment assembly problem. The DNA fragment assembly problem, known to be NP-hard, is of great importance as it constitutes an important step in the genome project. The POEMS is an iterative algorithm that employs an evolutionary algorithm for exploration of the current solution's neighborhood in each iteration of the optimization process. Experiments show that the proposed POEMS approach performs very well and generates better results than those generated by other state-of-the-art methods. The paper presents a successful application of an evolutionary based iterative optimization method called Prototype Optimization with Evolved Improvement Steps (POEMS) to the DNA fragment assembly problem. The DNA fragment assembly problem, known to be NP-hard, is of great importance as it constitutes an important step in the genome project. The POEMS is an iterative algorithm that employs an evolutionary algorithm for exploration of the current solution's neighborhood in each iteration of the optimization process. Experiments show that the proposed POEMS approach performs very well and generates better results than those generated by other state-of-the-art methods. (en)
Title	Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations (en)
skos:prefLabel	Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations Solving the DNA Fragment Assembly Problem Efficiently Using Iterative Optimization with Evolved Hypermutations (en)
skos:notation	RIV/68407700:21230/10:00171004!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Kubalík, Jiří Buryan, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	288565
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00171004
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Optimization; evolutionary algorithms; fragment assembly problem (en)
http://linked.open.../riv/klicoveSlovo	evolutionary algorithms Optimization fragment assembly problem
http://linked.open...ontrolniKodProRIV	[CE481A47BD86]
http://linked.open...v/mistoKonaniAkce	Portland, Oregon
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Buryan, Petr Kubalík, Jiří Wagner, L.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-07-07 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Transdisciplinární výzkum v oblasti biomedicínského inženýrství II
number of pages	2 (xsd:int)
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-4503-0073-5
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software