Finding Common Motifs with Gaps Using Finite Automata

Gespeichert in:

Autor*in:	Antoniou, Pavlos [verfasserIn] Holub, Jan Iliopoulos, Costas S. Melichar, Borivoj Peterlongo, Pierre

Format:	Artikel

Erschienen:	2006

Umfang:	9

Übergeordnetes Werk:	Enthalten in: Lecture notes in computer science - Berlin, Germany : Springer, 1973, 4094(2006), Seite 69-77
Übergeordnetes Werk:	volume:4094 ; year:2006 ; pages:69-77 ; extent:9

Katalog-ID:	OLC1723790400

Internformat


LEADER	01000caa a22002652 4500
001	OLC1723790400
003	DE-627
005	20220224092350.0
007	tu
008	060829s2006 xx \|\|\|\|\| 00\| \|\|und c
028	5	2	\|a sw060829
035			\|a (DE-627)OLC1723790400
035			\|a (DE-599)GBVOLC1723790400
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
082	0	4	\|a 004 \|a 620
082	0	4	\|a 620 \|q AVZ
100	1		\|a Antoniou, Pavlos \|e verfasserin \|4 aut
245	1	0	\|a Finding Common Motifs with Gaps Using Finite Automata
264		1	\|c 2006
300			\|a 9
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 Holub, Jan \|4 oth
700	1		\|a Iliopoulos, Costas S. \|4 oth
700	1		\|a Melichar, Borivoj \|4 oth
700	1		\|a Peterlongo, Pierre \|4 oth
773	0	8	\|i Enthalten in \|t Lecture notes in computer science \|d Berlin, Germany : Springer, 1973 \|g 4094(2006), Seite 69-77 \|w (DE-627)129300152 \|w (DE-600)121909-1 \|w (DE-576)014492687 \|x 0302-9743
773	1	8	\|g volume:4094 \|g year:2006 \|g pages:69-77 \|g extent:9
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 SSG-OPC-BBI
912			\|a GBV_ILN_70
912			\|a GBV_ILN_105
912			\|a GBV_ILN_2018
951			\|a AR
952			\|d 4094 \|j 2006 \|h 69-77 \|g 9

Indexfelder

author_variant	p a pa
matchkey_str	article:03029743:2006----::idncmomtfwtgpuig
hierarchy_sort_str	2006
publishDate	2006
allfields	sw060829 (DE-627)OLC1723790400 (DE-599)GBVOLC1723790400 DE-627 ger DE-627 rakwb 004 620 620 AVZ Antoniou, Pavlos verfasserin aut Finding Common Motifs with Gaps Using Finite Automata 2006 9 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Holub, Jan oth Iliopoulos, Costas S. oth Melichar, Borivoj oth Peterlongo, Pierre oth Enthalten in Lecture notes in computer science Berlin, Germany : Springer, 1973 4094(2006), Seite 69-77 (DE-627)129300152 (DE-600)121909-1 (DE-576)014492687 0302-9743 volume:4094 year:2006 pages:69-77 extent:9 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018 AR 4094 2006 69-77 9
spelling	sw060829 (DE-627)OLC1723790400 (DE-599)GBVOLC1723790400 DE-627 ger DE-627 rakwb 004 620 620 AVZ Antoniou, Pavlos verfasserin aut Finding Common Motifs with Gaps Using Finite Automata 2006 9 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Holub, Jan oth Iliopoulos, Costas S. oth Melichar, Borivoj oth Peterlongo, Pierre oth Enthalten in Lecture notes in computer science Berlin, Germany : Springer, 1973 4094(2006), Seite 69-77 (DE-627)129300152 (DE-600)121909-1 (DE-576)014492687 0302-9743 volume:4094 year:2006 pages:69-77 extent:9 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018 AR 4094 2006 69-77 9
allfields_unstemmed	sw060829 (DE-627)OLC1723790400 (DE-599)GBVOLC1723790400 DE-627 ger DE-627 rakwb 004 620 620 AVZ Antoniou, Pavlos verfasserin aut Finding Common Motifs with Gaps Using Finite Automata 2006 9 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Holub, Jan oth Iliopoulos, Costas S. oth Melichar, Borivoj oth Peterlongo, Pierre oth Enthalten in Lecture notes in computer science Berlin, Germany : Springer, 1973 4094(2006), Seite 69-77 (DE-627)129300152 (DE-600)121909-1 (DE-576)014492687 0302-9743 volume:4094 year:2006 pages:69-77 extent:9 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018 AR 4094 2006 69-77 9
allfieldsGer	sw060829 (DE-627)OLC1723790400 (DE-599)GBVOLC1723790400 DE-627 ger DE-627 rakwb 004 620 620 AVZ Antoniou, Pavlos verfasserin aut Finding Common Motifs with Gaps Using Finite Automata 2006 9 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Holub, Jan oth Iliopoulos, Costas S. oth Melichar, Borivoj oth Peterlongo, Pierre oth Enthalten in Lecture notes in computer science Berlin, Germany : Springer, 1973 4094(2006), Seite 69-77 (DE-627)129300152 (DE-600)121909-1 (DE-576)014492687 0302-9743 volume:4094 year:2006 pages:69-77 extent:9 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018 AR 4094 2006 69-77 9
allfieldsSound	sw060829 (DE-627)OLC1723790400 (DE-599)GBVOLC1723790400 DE-627 ger DE-627 rakwb 004 620 620 AVZ Antoniou, Pavlos verfasserin aut Finding Common Motifs with Gaps Using Finite Automata 2006 9 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Holub, Jan oth Iliopoulos, Costas S. oth Melichar, Borivoj oth Peterlongo, Pierre oth Enthalten in Lecture notes in computer science Berlin, Germany : Springer, 1973 4094(2006), Seite 69-77 (DE-627)129300152 (DE-600)121909-1 (DE-576)014492687 0302-9743 volume:4094 year:2006 pages:69-77 extent:9 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018 AR 4094 2006 69-77 9
source	Enthalten in Lecture notes in computer science 4094(2006), Seite 69-77 volume:4094 year:2006 pages:69-77 extent:9
sourceStr	Enthalten in Lecture notes in computer science 4094(2006), Seite 69-77 volume:4094 year:2006 pages:69-77 extent:9
format_phy_str_mv	Article
institution	findex.gbv.de
dewey-raw	004
isfreeaccess_bool	false
container_title	Lecture notes in computer science
authorswithroles_txt_mv	Antoniou, Pavlos @@aut@@ Holub, Jan @@oth@@ Iliopoulos, Costas S. @@oth@@ Melichar, Borivoj @@oth@@ Peterlongo, Pierre @@oth@@
publishDateDaySort_date	2006-01-01T00:00:00Z
hierarchy_top_id	129300152
dewey-sort	14
id	OLC1723790400
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">OLC1723790400</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220224092350.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">060829s2006 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw060829</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1723790400</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1723790400</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><subfield code="a">620</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Antoniou, Pavlos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding Common Motifs with Gaps Using Finite Automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">Holub, Jan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Iliopoulos, Costas S.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Melichar, Borivoj</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peterlongo, Pierre</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Lecture notes in computer science</subfield><subfield code="d">Berlin, Germany : Springer, 1973</subfield><subfield code="g">4094(2006), Seite 69-77</subfield><subfield code="w">(DE-627)129300152</subfield><subfield code="w">(DE-600)121909-1</subfield><subfield code="w">(DE-576)014492687</subfield><subfield code="x">0302-9743</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4094</subfield><subfield code="g">year:2006</subfield><subfield code="g">pages:69-77</subfield><subfield code="g">extent:9</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">SSG-OPC-BBI</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4094</subfield><subfield code="j">2006</subfield><subfield code="h">69-77</subfield><subfield code="g">9</subfield></datafield></record></collection>
author	Antoniou, Pavlos
spellingShingle	Antoniou, Pavlos ddc 004 ddc 620 Finding Common Motifs with Gaps Using Finite Automata
authorStr	Antoniou, Pavlos
ppnlink_with_tag_str_mv	@@773@@(DE-627)129300152
format	Article
dewey-ones	004 - Data processing & computer science 620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0302-9743
topic_title	004 620 620 AVZ Finding Common Motifs with Gaps Using Finite Automata
topic	ddc 004 ddc 620
topic_unstemmed	ddc 004 ddc 620
topic_browse	ddc 004 ddc 620
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	j h jh c s i cs csi b m bm p p pp
hierarchy_parent_title	Lecture notes in computer science
hierarchy_parent_id	129300152
dewey-tens	000 - Computer science, knowledge & systems 620 - Engineering
hierarchy_top_title	Lecture notes in computer science
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129300152 (DE-600)121909-1 (DE-576)014492687
title	Finding Common Motifs with Gaps Using Finite Automata
ctrlnum	(DE-627)OLC1723790400 (DE-599)GBVOLC1723790400
title_full	Finding Common Motifs with Gaps Using Finite Automata
author_sort	Antoniou, Pavlos
journal	Lecture notes in computer science
journalStr	Lecture notes in computer science
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works 600 - Technology
recordtype	marc
publishDateSort	2006
contenttype_str_mv	txt
container_start_page	69
author_browse	Antoniou, Pavlos
container_volume	4094
physical	9
class	004 620 620 AVZ
format_se	Aufsätze
author-letter	Antoniou, Pavlos
dewey-full	004 620
title_sort	finding common motifs with gaps using finite automata
title_auth	Finding Common Motifs with Gaps Using Finite Automata
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_105 GBV_ILN_2018
title_short	Finding Common Motifs with Gaps Using Finite Automata
remote_bool	false
author2	Holub, Jan Iliopoulos, Costas S. Melichar, Borivoj Peterlongo, Pierre
author2Str	Holub, Jan Iliopoulos, Costas S. Melichar, Borivoj Peterlongo, Pierre
ppnlink	129300152
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth oth oth
up_date	2024-07-03T19:42:46.472Z
_version_	1803588223866241024
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">OLC1723790400</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220224092350.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">060829s2006 xx \|\|\|\|\| 00\| \|\|und c</controlfield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">sw060829</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1723790400</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1723790400</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><subfield code="a">620</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Antoniou, Pavlos</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding Common Motifs with Gaps Using Finite Automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9</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">Holub, Jan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Iliopoulos, Costas S.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Melichar, Borivoj</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peterlongo, Pierre</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Lecture notes in computer science</subfield><subfield code="d">Berlin, Germany : Springer, 1973</subfield><subfield code="g">4094(2006), Seite 69-77</subfield><subfield code="w">(DE-627)129300152</subfield><subfield code="w">(DE-600)121909-1</subfield><subfield code="w">(DE-576)014492687</subfield><subfield code="x">0302-9743</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4094</subfield><subfield code="g">year:2006</subfield><subfield code="g">pages:69-77</subfield><subfield code="g">extent:9</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">SSG-OPC-BBI</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_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4094</subfield><subfield code="j">2006</subfield><subfield code="h">69-77</subfield><subfield code="g">9</subfield></datafield></record></collection>
score	7.3974905

Nicht das Richtige dabei?

Schreiben Sie uns!

Finding Common Motifs with Gaps Using Finite Automata

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?