The maximum agreement forest problem: Approximation algorithms and computational experiments

Gespeichert in:

Autor*in:	Rodrigues, Estela M. [verfasserIn] Sagot, Marie-France Wakabayashi, Yoshiko

Format:	Artikel

Erschienen:	2007

Systematik:	SQ 1100:

Umfang:	20

Übergeordnetes Werk:	Enthalten in: Theoretical computer science - Amsterdam [u.a.] : Elsevier, 1975, 374(2007), 1, Seite 91-110
Übergeordnetes Werk:	volume:374 ; year:2007 ; number:1 ; pages:91-110 ; extent:20

Katalog-ID:	OLC1765868246

Internformat


LEADER	01000caa a22002652 4500
001	OLC1765868246
003	DE-627
005	20220221163422.0
007	tu
008	070327s2007 xx \|\|\|\|\| 00\| \|\|und c
028	5	2	\|a sw070327
035			\|a (DE-627)OLC1765868246
035			\|a (DE-599)GBVOLC1765868246
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
082	0	4	\|a 004
084			\|a SQ 1100: \|q AVZ \|2 rvk
084			\|a 54.10 \|2 bkl
100	1		\|a Rodrigues, Estela M. \|e verfasserin \|4 aut
245	1	4	\|a The maximum agreement forest problem: Approximation algorithms and computational experiments
264		1	\|c 2007
300			\|a 20
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
700	1		\|a Sagot, Marie-France \|4 oth
700	1		\|a Wakabayashi, Yoshiko \|4 oth
773	0	8	\|i Enthalten in \|t Theoretical computer science \|d Amsterdam [u.a.] : Elsevier, 1975 \|g 374(2007), 1, Seite 91-110 \|w (DE-627)129435333 \|w (DE-600)193706-6 \|w (DE-576)014806770 \|x 0304-3975 \|7 nnns
773	1	8	\|g volume:374 \|g year:2007 \|g number:1 \|g pages:91-110 \|g extent:20
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_21
912			\|a GBV_ILN_22
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_40
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_70
912			\|a GBV_ILN_120
912			\|a GBV_ILN_285
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2012
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4316
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4700
936	r	v	\|a SQ 1100:
936	b	k	\|a 54.10 \|q AVZ
951			\|a AR
952			\|d 374 \|j 2007 \|e 1 \|h 91-110 \|g 20

Indexfelder

author_variant	e m r em emr
matchkey_str	article:03043975:2007----::hmxmmgemnfrspolmprxmtoagrtmado
hierarchy_sort_str	2007
bklnumber	54.10
publishDate	2007
allfields	sw070327 (DE-627)OLC1765868246 (DE-599)GBVOLC1765868246 DE-627 ger DE-627 rakwb 004 SQ 1100: AVZ rvk 54.10 bkl Rodrigues, Estela M. verfasserin aut The maximum agreement forest problem: Approximation algorithms and computational experiments 2007 20 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sagot, Marie-France oth Wakabayashi, Yoshiko oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 374(2007), 1, Seite 91-110 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:374 year:2007 number:1 pages:91-110 extent:20 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 SQ 1100: 54.10 AVZ AR 374 2007 1 91-110 20
spelling	sw070327 (DE-627)OLC1765868246 (DE-599)GBVOLC1765868246 DE-627 ger DE-627 rakwb 004 SQ 1100: AVZ rvk 54.10 bkl Rodrigues, Estela M. verfasserin aut The maximum agreement forest problem: Approximation algorithms and computational experiments 2007 20 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sagot, Marie-France oth Wakabayashi, Yoshiko oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 374(2007), 1, Seite 91-110 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:374 year:2007 number:1 pages:91-110 extent:20 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 SQ 1100: 54.10 AVZ AR 374 2007 1 91-110 20
allfields_unstemmed	sw070327 (DE-627)OLC1765868246 (DE-599)GBVOLC1765868246 DE-627 ger DE-627 rakwb 004 SQ 1100: AVZ rvk 54.10 bkl Rodrigues, Estela M. verfasserin aut The maximum agreement forest problem: Approximation algorithms and computational experiments 2007 20 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sagot, Marie-France oth Wakabayashi, Yoshiko oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 374(2007), 1, Seite 91-110 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:374 year:2007 number:1 pages:91-110 extent:20 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 SQ 1100: 54.10 AVZ AR 374 2007 1 91-110 20
allfieldsGer	sw070327 (DE-627)OLC1765868246 (DE-599)GBVOLC1765868246 DE-627 ger DE-627 rakwb 004 SQ 1100: AVZ rvk 54.10 bkl Rodrigues, Estela M. verfasserin aut The maximum agreement forest problem: Approximation algorithms and computational experiments 2007 20 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sagot, Marie-France oth Wakabayashi, Yoshiko oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 374(2007), 1, Seite 91-110 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:374 year:2007 number:1 pages:91-110 extent:20 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 SQ 1100: 54.10 AVZ AR 374 2007 1 91-110 20
allfieldsSound	sw070327 (DE-627)OLC1765868246 (DE-599)GBVOLC1765868246 DE-627 ger DE-627 rakwb 004 SQ 1100: AVZ rvk 54.10 bkl Rodrigues, Estela M. verfasserin aut The maximum agreement forest problem: Approximation algorithms and computational experiments 2007 20 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sagot, Marie-France oth Wakabayashi, Yoshiko oth Enthalten in Theoretical computer science Amsterdam [u.a.] : Elsevier, 1975 374(2007), 1, Seite 91-110 (DE-627)129435333 (DE-600)193706-6 (DE-576)014806770 0304-3975 nnns volume:374 year:2007 number:1 pages:91-110 extent:20 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 SQ 1100: 54.10 AVZ AR 374 2007 1 91-110 20
source	Enthalten in Theoretical computer science 374(2007), 1, Seite 91-110 volume:374 year:2007 number:1 pages:91-110 extent:20
sourceStr	Enthalten in Theoretical computer science 374(2007), 1, Seite 91-110 volume:374 year:2007 number:1 pages:91-110 extent:20
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Theoretical computer science
authorswithroles_txt_mv	Rodrigues, Estela M. @@aut@@ Sagot, Marie-France @@oth@@ Wakabayashi, Yoshiko @@oth@@
publishDateDaySort_date	2007-01-01T00:00:00Z
hierarchy_top_id	129435333
dewey-sort	14
id	OLC1765868246
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1765868246</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163422.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">070327s2007 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw070327</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1765868246</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1765868246</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SQ 1100:</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rodrigues, Estela M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The maximum agreement forest problem: Approximation algorithms and computational experiments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sagot, Marie-France</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wakabayashi, Yoshiko</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">374(2007), 1, Seite 91-110</subfield><subfield code="w">(DE-627)129435333</subfield><subfield code="w">(DE-600)193706-6</subfield><subfield code="w">(DE-576)014806770</subfield><subfield code="x">0304-3975</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:374</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:91-110</subfield><subfield code="g">extent:20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SQ 1100:</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">374</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="h">91-110</subfield><subfield code="g">20</subfield></datafield></record></collection>
author	Rodrigues, Estela M.
spellingShingle	Rodrigues, Estela M. ddc 004 rvk SQ 1100: bkl 54.10 The maximum agreement forest problem: Approximation algorithms and computational experiments
authorStr	Rodrigues, Estela M.
ppnlink_with_tag_str_mv	@@773@@(DE-627)129435333
format	Article
dewey-ones	004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0304-3975
topic_title	004 SQ 1100: AVZ rvk 54.10 bkl The maximum agreement forest problem: Approximation algorithms and computational experiments
topic	ddc 004 rvk SQ 1100: bkl 54.10
topic_unstemmed	ddc 004 rvk SQ 1100: bkl 54.10
topic_browse	ddc 004 rvk SQ 1100: bkl 54.10
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	m f s mfs y w yw
hierarchy_parent_title	Theoretical computer science
hierarchy_parent_id	129435333
dewey-tens	000 - Computer science, knowledge & systems
hierarchy_top_title	Theoretical computer science
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129435333 (DE-600)193706-6 (DE-576)014806770
title	The maximum agreement forest problem: Approximation algorithms and computational experiments
ctrlnum	(DE-627)OLC1765868246 (DE-599)GBVOLC1765868246
title_full	The maximum agreement forest problem: Approximation algorithms and computational experiments
author_sort	Rodrigues, Estela M.
journal	Theoretical computer science
journalStr	Theoretical computer science
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	2007
contenttype_str_mv	txt
container_start_page	91
author_browse	Rodrigues, Estela M.
container_volume	374
physical	20
class	004 SQ 1100: AVZ rvk 54.10 bkl
format_se	Aufsätze
author-letter	Rodrigues, Estela M.
dewey-full	004
title_sort	maximum agreement forest problem: approximation algorithms and computational experiments
title_auth	The maximum agreement forest problem: Approximation algorithms and computational experiments
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_120 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2012 GBV_ILN_2021 GBV_ILN_4046 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700
container_issue	1
title_short	The maximum agreement forest problem: Approximation algorithms and computational experiments
remote_bool	false
author2	Sagot, Marie-France Wakabayashi, Yoshiko
author2Str	Sagot, Marie-France Wakabayashi, Yoshiko
ppnlink	129435333
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth
up_date	2024-07-03T21:35:23.480Z
_version_	1803595309101613056
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC1765868246</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163422.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">070327s2007 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw070327</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1765868246</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1765868246</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SQ 1100:</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rodrigues, Estela M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The maximum agreement forest problem: Approximation algorithms and computational experiments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sagot, Marie-France</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wakabayashi, Yoshiko</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theoretical computer science</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1975</subfield><subfield code="g">374(2007), 1, Seite 91-110</subfield><subfield code="w">(DE-627)129435333</subfield><subfield code="w">(DE-600)193706-6</subfield><subfield code="w">(DE-576)014806770</subfield><subfield code="x">0304-3975</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:374</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:91-110</subfield><subfield code="g">extent:20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SQ 1100:</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">374</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="h">91-110</subfield><subfield code="g">20</subfield></datafield></record></collection>
score	7.4000216

Nicht das Richtige dabei?

Schreiben Sie uns!

The maximum agreement forest problem: Approximation algorithms and computational experiments

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?