A negative answer to a problem on generalized Fibonacci cubes
Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , de...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Wei, Jianxin [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
6 |
|---|
| Übergeordnetes Werk: |
Enthalten in: A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations - Guo, Bangwei ELSEVIER, 2023, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:340 ; year:2017 ; number:2 ; day:6 ; month:02 ; pages:81-86 ; extent:6 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.disc.2016.07.016 |
|---|
| Katalog-ID: |
ELV020547153 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV020547153 | ||
| 003 | DE-627 | ||
| 005 | 20230625132035.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2017 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.disc.2016.07.016 |2 doi | |
| 028 | 5 | 2 | |a GBVA2017020000018.pica |
| 035 | |a (DE-627)ELV020547153 | ||
| 035 | |a (ELSEVIER)S0012-365X(16)30237-0 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 510 | |
| 082 | 0 | 4 | |a 510 |q DE-600 |
| 082 | 0 | 4 | |a 610 |q VZ |
| 084 | |a 44.64 |2 bkl | ||
| 084 | |a 44.32 |2 bkl | ||
| 100 | 1 | |a Wei, Jianxin |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A negative answer to a problem on generalized Fibonacci cubes |
| 264 | 1 | |c 2017transfer abstract | |
| 300 | |a 6 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. | ||
| 520 | |a Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. | ||
| 650 | 7 | |a Generalized Fibonacci cube |2 Elsevier | |
| 650 | 7 | |a Bad string |2 Elsevier | |
| 650 | 7 | |a Isometric subgraph |2 Elsevier | |
| 650 | 7 | |a Fibonacci cube |2 Elsevier | |
| 650 | 7 | |a Isometric embedding |2 Elsevier | |
| 700 | 1 | |a Zhang, Heping |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Guo, Bangwei ELSEVIER |t A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |d 2023 |g Amsterdam [u.a.] |w (DE-627)ELV009312048 |
| 773 | 1 | 8 | |g volume:340 |g year:2017 |g number:2 |g day:6 |g month:02 |g pages:81-86 |g extent:6 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.disc.2016.07.016 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 936 | b | k | |a 44.64 |j Radiologie |q VZ |
| 936 | b | k | |a 44.32 |j Medizinische Mathematik |j medizinische Statistik |q VZ |
| 951 | |a AR | ||
| 952 | |d 340 |j 2017 |e 2 |b 6 |c 0206 |h 81-86 |g 6 | ||
| 953 | |2 045F |a 510 | ||
| author_variant |
j w jw |
|---|---|
| matchkey_str |
weijianxinzhangheping:2017----:ngtvasetarbeognrlzd |
| hierarchy_sort_str |
2017transfer abstract |
| bklnumber |
44.64 44.32 |
| publishDate |
2017 |
| allfields |
10.1016/j.disc.2016.07.016 doi GBVA2017020000018.pica (DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 DE-627 ger DE-627 rakwb eng 510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl Wei, Jianxin verfasserin aut A negative answer to a problem on generalized Fibonacci cubes 2017transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier Zhang, Heping oth Enthalten in Elsevier Guo, Bangwei ELSEVIER A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations 2023 Amsterdam [u.a.] (DE-627)ELV009312048 volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 https://doi.org/10.1016/j.disc.2016.07.016 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.64 Radiologie VZ 44.32 Medizinische Mathematik medizinische Statistik VZ AR 340 2017 2 6 0206 81-86 6 045F 510 |
| spelling |
10.1016/j.disc.2016.07.016 doi GBVA2017020000018.pica (DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 DE-627 ger DE-627 rakwb eng 510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl Wei, Jianxin verfasserin aut A negative answer to a problem on generalized Fibonacci cubes 2017transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier Zhang, Heping oth Enthalten in Elsevier Guo, Bangwei ELSEVIER A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations 2023 Amsterdam [u.a.] (DE-627)ELV009312048 volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 https://doi.org/10.1016/j.disc.2016.07.016 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.64 Radiologie VZ 44.32 Medizinische Mathematik medizinische Statistik VZ AR 340 2017 2 6 0206 81-86 6 045F 510 |
| allfields_unstemmed |
10.1016/j.disc.2016.07.016 doi GBVA2017020000018.pica (DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 DE-627 ger DE-627 rakwb eng 510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl Wei, Jianxin verfasserin aut A negative answer to a problem on generalized Fibonacci cubes 2017transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier Zhang, Heping oth Enthalten in Elsevier Guo, Bangwei ELSEVIER A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations 2023 Amsterdam [u.a.] (DE-627)ELV009312048 volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 https://doi.org/10.1016/j.disc.2016.07.016 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.64 Radiologie VZ 44.32 Medizinische Mathematik medizinische Statistik VZ AR 340 2017 2 6 0206 81-86 6 045F 510 |
| allfieldsGer |
10.1016/j.disc.2016.07.016 doi GBVA2017020000018.pica (DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 DE-627 ger DE-627 rakwb eng 510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl Wei, Jianxin verfasserin aut A negative answer to a problem on generalized Fibonacci cubes 2017transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier Zhang, Heping oth Enthalten in Elsevier Guo, Bangwei ELSEVIER A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations 2023 Amsterdam [u.a.] (DE-627)ELV009312048 volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 https://doi.org/10.1016/j.disc.2016.07.016 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.64 Radiologie VZ 44.32 Medizinische Mathematik medizinische Statistik VZ AR 340 2017 2 6 0206 81-86 6 045F 510 |
| allfieldsSound |
10.1016/j.disc.2016.07.016 doi GBVA2017020000018.pica (DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 DE-627 ger DE-627 rakwb eng 510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl Wei, Jianxin verfasserin aut A negative answer to a problem on generalized Fibonacci cubes 2017transfer abstract 6 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier Zhang, Heping oth Enthalten in Elsevier Guo, Bangwei ELSEVIER A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations 2023 Amsterdam [u.a.] (DE-627)ELV009312048 volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 https://doi.org/10.1016/j.disc.2016.07.016 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA 44.64 Radiologie VZ 44.32 Medizinische Mathematik medizinische Statistik VZ AR 340 2017 2 6 0206 81-86 6 045F 510 |
| language |
English |
| source |
Enthalten in A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations Amsterdam [u.a.] volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 |
| sourceStr |
Enthalten in A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations Amsterdam [u.a.] volume:340 year:2017 number:2 day:6 month:02 pages:81-86 extent:6 |
| format_phy_str_mv |
Article |
| bklname |
Radiologie Medizinische Mathematik medizinische Statistik |
| institution |
findex.gbv.de |
| topic_facet |
Generalized Fibonacci cube Bad string Isometric subgraph Fibonacci cube Isometric embedding |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |
| authorswithroles_txt_mv |
Wei, Jianxin @@aut@@ Zhang, Heping @@oth@@ |
| publishDateDaySort_date |
2017-01-06T00:00:00Z |
| hierarchy_top_id |
ELV009312048 |
| dewey-sort |
3510 |
| id |
ELV020547153 |
| language_de |
englisch |
| 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">ELV020547153</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625132035.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.disc.2016.07.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017020000018.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV020547153</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0012-365X(16)30237-0</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="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.64</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.32</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Jianxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A negative answer to a problem on generalized Fibonacci cubes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Generalized Fibonacci cube</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bad string</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isometric subgraph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fibonacci cube</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isometric embedding</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Heping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Guo, Bangwei ELSEVIER</subfield><subfield code="t">A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations</subfield><subfield code="d">2023</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV009312048</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:340</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:2</subfield><subfield code="g">day:6</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:81-86</subfield><subfield code="g">extent:6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.disc.2016.07.016</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.64</subfield><subfield code="j">Radiologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.32</subfield><subfield code="j">Medizinische Mathematik</subfield><subfield code="j">medizinische Statistik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">340</subfield><subfield code="j">2017</subfield><subfield code="e">2</subfield><subfield code="b">6</subfield><subfield code="c">0206</subfield><subfield code="h">81-86</subfield><subfield code="g">6</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| author |
Wei, Jianxin |
| spellingShingle |
Wei, Jianxin ddc 510 ddc 610 bkl 44.64 bkl 44.32 Elsevier Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding A negative answer to a problem on generalized Fibonacci cubes |
| authorStr |
Wei, Jianxin |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV009312048 |
| format |
electronic Article |
| dewey-ones |
510 - Mathematics 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl A negative answer to a problem on generalized Fibonacci cubes Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding Elsevier |
| topic |
ddc 510 ddc 610 bkl 44.64 bkl 44.32 Elsevier Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding |
| topic_unstemmed |
ddc 510 ddc 610 bkl 44.64 bkl 44.32 Elsevier Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding |
| topic_browse |
ddc 510 ddc 610 bkl 44.64 bkl 44.32 Elsevier Generalized Fibonacci cube Elsevier Bad string Elsevier Isometric subgraph Elsevier Fibonacci cube Elsevier Isometric embedding |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
h z hz |
| hierarchy_parent_title |
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |
| hierarchy_parent_id |
ELV009312048 |
| dewey-tens |
510 - Mathematics 610 - Medicine & health |
| hierarchy_top_title |
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV009312048 |
| title |
A negative answer to a problem on generalized Fibonacci cubes |
| ctrlnum |
(DE-627)ELV020547153 (ELSEVIER)S0012-365X(16)30237-0 |
| title_full |
A negative answer to a problem on generalized Fibonacci cubes |
| author_sort |
Wei, Jianxin |
| journal |
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |
| journalStr |
A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
zzz |
| container_start_page |
81 |
| author_browse |
Wei, Jianxin |
| container_volume |
340 |
| physical |
6 |
| class |
510 510 DE-600 610 VZ 44.64 bkl 44.32 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Wei, Jianxin |
| doi_str_mv |
10.1016/j.disc.2016.07.016 |
| dewey-full |
510 610 |
| title_sort |
a negative answer to a problem on generalized fibonacci cubes |
| title_auth |
A negative answer to a problem on generalized Fibonacci cubes |
| abstract |
Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. |
| abstractGer |
Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. |
| abstract_unstemmed |
Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA |
| container_issue |
2 |
| title_short |
A negative answer to a problem on generalized Fibonacci cubes |
| url |
https://doi.org/10.1016/j.disc.2016.07.016 |
| remote_bool |
true |
| author2 |
Zhang, Heping |
| author2Str |
Zhang, Heping |
| ppnlink |
ELV009312048 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1016/j.disc.2016.07.016 |
| up_date |
2024-07-06T17:53:52.914Z |
| _version_ |
1803853163832279040 |
| 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">ELV020547153</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625132035.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.disc.2016.07.016</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017020000018.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV020547153</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0012-365X(16)30237-0</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="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.64</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.32</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Jianxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A negative answer to a problem on generalized Fibonacci cubes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Generalized Fibonacci cube Q n ( f ) is the graph obtained from the n -cube Q n by removing all vertices that contain a given binary string f as a consecutive substring. A binary string f is called bad if Q n ( f ) is not an isometric subgraph of Q n for some n , and the smallest such integer n , denoted by B ( f ) , is called the index of f . Ilić, Klavžar and Rho posed a problem that if Q n ( f ) is not an isometric subgraph of Q n , is there a dimension n ′ such that Q n ( f ) can be isometrically embedded into Q n ′ ? We give a negative answer to this problem by showing that if f is bad, then for any n ≥ B ( f ) , Q n ( f ) cannot be isometrically embedded to any hypercube.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Generalized Fibonacci cube</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bad string</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isometric subgraph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fibonacci cube</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Isometric embedding</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Heping</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Guo, Bangwei ELSEVIER</subfield><subfield code="t">A robust and lightweight deep attention multiple instance learning algorithm for predicting genetic alterations</subfield><subfield code="d">2023</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV009312048</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:340</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:2</subfield><subfield code="g">day:6</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:81-86</subfield><subfield code="g">extent:6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.disc.2016.07.016</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.64</subfield><subfield code="j">Radiologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.32</subfield><subfield code="j">Medizinische Mathematik</subfield><subfield code="j">medizinische Statistik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">340</subfield><subfield code="j">2017</subfield><subfield code="e">2</subfield><subfield code="b">6</subfield><subfield code="c">0206</subfield><subfield code="h">81-86</subfield><subfield code="g">6</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">510</subfield></datafield></record></collection>
|
| score |
7.4002314 |