Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

Gespeichert in:

Autor*in:	Biondi, E [verfasserIn] Zivkovic, L Esposito, L Pesaresi, S

Format:	Artikel

Erschienen:	2009

Umfang:	10

Übergeordnetes Werk:	Enthalten in: Fundamenta informaticae - Amsterdam [u.a.] : IOS Press, 1992, 97(2009), 3 vom: 1. Jan., Seite 311-321
Übergeordnetes Werk:	volume:97 ; year:2009 ; number:3 ; day:1 ; month:01 ; pages:311-321 ; extent:10

Katalog-ID:	OLC1832276767

Internformat


LEADER	01000caa a22002652 4500
001	OLC1832276767
003	DE-627
005	20210712222127.0
007	tu
008	091230s2009 xx \|\|\|\|\| 00\| \|\|und c
028	5	2	\|a sw091229_1
035			\|a (DE-627)OLC1832276767
035			\|a (DE-599)GBVOLC1832276767
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
082	0	4	\|a 510
100	1		\|a Biondi, E \|e verfasserin \|4 aut
245	1	0	\|a Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
264		1	\|c 2009
300			\|a 10
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 Zivkovic, L \|4 oth
700	1		\|a Esposito, L \|4 oth
700	1		\|a Pesaresi, S \|4 oth
773	0	8	\|i Enthalten in \|t Fundamenta informaticae \|d Amsterdam [u.a.] : IOS Press, 1992 \|g 97(2009), 3 vom: 1. Jan., Seite 311-321 \|w (DE-627)131147145 \|w (DE-600)1128979-X \|w (DE-576)032856318 \|x 0169-2968 \|7 nnns
773	1	8	\|g volume:97 \|g year:2009 \|g number:3 \|g day:1 \|g month:01 \|g pages:311-321 \|g extent:10
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_22
912			\|a GBV_ILN_24
912			\|a GBV_ILN_70
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_120
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4316
951			\|a AR
952			\|d 97 \|j 2009 \|e 3 \|b 1 \|c 1 \|h 311-321 \|g 10

Indexfelder

author_variant	e b eb
matchkey_str	article:01692968:2009----::atrloihsocmuigaiamlieeti
hierarchy_sort_str	2009
publishDate	2009
allfields	sw091229_1 (DE-627)OLC1832276767 (DE-599)GBVOLC1832276767 DE-627 ger DE-627 rakwb 510 Biondi, E verfasserin aut Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences 2009 10 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zivkovic, L oth Esposito, L oth Pesaresi, S oth Enthalten in Fundamenta informaticae Amsterdam [u.a.] : IOS Press, 1992 97(2009), 3 vom: 1. Jan., Seite 311-321 (DE-627)131147145 (DE-600)1128979-X (DE-576)032856318 0169-2968 nnns volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316 AR 97 2009 3 1 1 311-321 10
spelling	sw091229_1 (DE-627)OLC1832276767 (DE-599)GBVOLC1832276767 DE-627 ger DE-627 rakwb 510 Biondi, E verfasserin aut Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences 2009 10 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zivkovic, L oth Esposito, L oth Pesaresi, S oth Enthalten in Fundamenta informaticae Amsterdam [u.a.] : IOS Press, 1992 97(2009), 3 vom: 1. Jan., Seite 311-321 (DE-627)131147145 (DE-600)1128979-X (DE-576)032856318 0169-2968 nnns volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316 AR 97 2009 3 1 1 311-321 10
allfields_unstemmed	sw091229_1 (DE-627)OLC1832276767 (DE-599)GBVOLC1832276767 DE-627 ger DE-627 rakwb 510 Biondi, E verfasserin aut Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences 2009 10 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zivkovic, L oth Esposito, L oth Pesaresi, S oth Enthalten in Fundamenta informaticae Amsterdam [u.a.] : IOS Press, 1992 97(2009), 3 vom: 1. Jan., Seite 311-321 (DE-627)131147145 (DE-600)1128979-X (DE-576)032856318 0169-2968 nnns volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316 AR 97 2009 3 1 1 311-321 10
allfieldsGer	sw091229_1 (DE-627)OLC1832276767 (DE-599)GBVOLC1832276767 DE-627 ger DE-627 rakwb 510 Biondi, E verfasserin aut Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences 2009 10 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zivkovic, L oth Esposito, L oth Pesaresi, S oth Enthalten in Fundamenta informaticae Amsterdam [u.a.] : IOS Press, 1992 97(2009), 3 vom: 1. Jan., Seite 311-321 (DE-627)131147145 (DE-600)1128979-X (DE-576)032856318 0169-2968 nnns volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316 AR 97 2009 3 1 1 311-321 10
allfieldsSound	sw091229_1 (DE-627)OLC1832276767 (DE-599)GBVOLC1832276767 DE-627 ger DE-627 rakwb 510 Biondi, E verfasserin aut Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences 2009 10 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Zivkovic, L oth Esposito, L oth Pesaresi, S oth Enthalten in Fundamenta informaticae Amsterdam [u.a.] : IOS Press, 1992 97(2009), 3 vom: 1. Jan., Seite 311-321 (DE-627)131147145 (DE-600)1128979-X (DE-576)032856318 0169-2968 nnns volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316 AR 97 2009 3 1 1 311-321 10
source	Enthalten in Fundamenta informaticae 97(2009), 3 vom: 1. Jan., Seite 311-321 volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10
sourceStr	Enthalten in Fundamenta informaticae 97(2009), 3 vom: 1. Jan., Seite 311-321 volume:97 year:2009 number:3 day:1 month:01 pages:311-321 extent:10
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	510
isfreeaccess_bool	false
container_title	Fundamenta informaticae
authorswithroles_txt_mv	Biondi, E @@aut@@ Zivkovic, L @@oth@@ Esposito, L @@oth@@ Pesaresi, S @@oth@@
publishDateDaySort_date	2009-01-01T00:00:00Z
hierarchy_top_id	131147145
dewey-sort	3510
id	OLC1832276767
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">OLC1832276767</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210712222127.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">091230s2009 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw091229_1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1832276767</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1832276767</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">510</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Biondi, E</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</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">Zivkovic, L</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Esposito, L</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pesaresi, S</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Fundamenta informaticae</subfield><subfield code="d">Amsterdam [u.a.] : IOS Press, 1992</subfield><subfield code="g">97(2009), 3 vom: 1. Jan., Seite 311-321</subfield><subfield code="w">(DE-627)131147145</subfield><subfield code="w">(DE-600)1128979-X</subfield><subfield code="w">(DE-576)032856318</subfield><subfield code="x">0169-2968</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:97</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:3</subfield><subfield code="g">day:1</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:311-321</subfield><subfield code="g">extent:10</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-MAT</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</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_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_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</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_4316</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">97</subfield><subfield code="j">2009</subfield><subfield code="e">3</subfield><subfield code="b">1</subfield><subfield code="c">1</subfield><subfield code="h">311-321</subfield><subfield code="g">10</subfield></datafield></record></collection>
author	Biondi, E
spellingShingle	Biondi, E ddc 510 Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
authorStr	Biondi, E
ppnlink_with_tag_str_mv	@@773@@(DE-627)131147145
format	Article
dewey-ones	510 - Mathematics
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0169-2968
topic_title	510 Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
topic	ddc 510
topic_unstemmed	ddc 510
topic_browse	ddc 510
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	l z lz l e le s p sp
hierarchy_parent_title	Fundamenta informaticae
hierarchy_parent_id	131147145
dewey-tens	510 - Mathematics
hierarchy_top_title	Fundamenta informaticae
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)131147145 (DE-600)1128979-X (DE-576)032856318
title	Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
ctrlnum	(DE-627)OLC1832276767 (DE-599)GBVOLC1832276767
title_full	Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
author_sort	Biondi, E
journal	Fundamenta informaticae
journalStr	Fundamenta informaticae
isOA_bool	false
dewey-hundreds	500 - Science
recordtype	marc
publishDateSort	2009
contenttype_str_mv	txt
container_start_page	311
author_browse	Biondi, E
container_volume	97
physical	10
class	510
format_se	Aufsätze
author-letter	Biondi, E
dewey-full	510
title_sort	faster algorithms for computing maximal multirepeats in multiple sequences
title_auth	Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4316
container_issue	3
title_short	Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
remote_bool	false
author2	Zivkovic, L Esposito, L Pesaresi, S
author2Str	Zivkovic, L Esposito, L Pesaresi, S
ppnlink	131147145
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth oth
up_date	2024-07-03T14:13:56.275Z
_version_	1803567535249948672
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">OLC1832276767</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210712222127.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">091230s2009 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw091229_1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1832276767</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1832276767</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">510</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Biondi, E</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</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">Zivkovic, L</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Esposito, L</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pesaresi, S</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Fundamenta informaticae</subfield><subfield code="d">Amsterdam [u.a.] : IOS Press, 1992</subfield><subfield code="g">97(2009), 3 vom: 1. Jan., Seite 311-321</subfield><subfield code="w">(DE-627)131147145</subfield><subfield code="w">(DE-600)1128979-X</subfield><subfield code="w">(DE-576)032856318</subfield><subfield code="x">0169-2968</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:97</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:3</subfield><subfield code="g">day:1</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:311-321</subfield><subfield code="g">extent:10</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-MAT</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</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_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_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</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_4316</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">97</subfield><subfield code="j">2009</subfield><subfield code="e">3</subfield><subfield code="b">1</subfield><subfield code="c">1</subfield><subfield code="h">311-321</subfield><subfield code="g">10</subfield></datafield></record></collection>
score	7.39892

Nicht das Richtige dabei?

Schreiben Sie uns!

Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?