Analysis and enumeration: algorithms for biological graphs
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Paris
Atlantis Press
2015
|
| Schriftenreihe: | Atlantis Studies in Computing
6 |
| Schlagworte: | |
| Online-Zugang: | BTU01 FRO01 TUM01 UBM01 UBT01 UBW01 UPA01 Volltext Inhaltsverzeichnis Abstract |
| Beschreibung: | 1 Online-Ressource (XVII, 151 S.) 39 illus |
| ISBN: | 9789462390973 |
| ISSN: | 2212-8557 |
| DOI: | 10.2991/978-94-6239-097-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042482274 | ||
| 003 | DE-604 | ||
| 005 | 20200929 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150402s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9789462390973 |c Online |9 978-94-6239-097-3 | ||
| 024 | 7 | |a 10.2991/978-94-6239-097-3 |2 doi | |
| 035 | |a (OCoLC)906205516 | ||
| 035 | |a (DE-599)BVBBV042482274 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-19 |a DE-703 |a DE-20 |a DE-739 |a DE-634 |a DE-861 |a DE-83 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Marino, Andrea |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Analysis and enumeration |b algorithms for biological graphs |c Andrea Marino |
| 264 | 1 | |a Paris |b Atlantis Press |c 2015 | |
| 300 | |a 1 Online-Ressource (XVII, 151 S.) |b 39 illus | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Atlantis studies in computing |v 6 |x 2212-8557 | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Data mining | |
| 650 | 4 | |a Bioinformatics | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Data Mining and Knowledge Discovery | |
| 650 | 4 | |a Computational Biology/Bioinformatics | |
| 650 | 4 | |a Informatik | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-94-6239-096-6 |
| 830 | 0 | |a Atlantis Studies in Computing |v 6 |w (DE-604)BV040353030 |9 6 | |
| 856 | 4 | 0 | |u https://doi.org/10.2991/978-94-6239-097-3 |x Verlag |3 Volltext |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
| 912 | |a ZDB-2-SMA | ||
| 940 | 1 | |q UBY_PDA_SMA | |
| 940 | 1 | |q ZDB-2-SMA_2015 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027917233 | ||
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l BTU01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l FRO01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l TUM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l UBM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l UBT01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l UBW01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.2991/978-94-6239-097-3 |l UPA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804153212546056192 |
|---|---|
| adam_text | ANALYSIS AND ENUMERATION
/ MARINO, ANDREA
: 2015
TABLE OF CONTENTS / INHALTSVERZEICHNIS
INTRODUCTION
ENUMERATION ALGORITHMS
AN APPLICATION: BIOLOGICAL GRAPH ANALYSIS
TELLING STORIES: ENUMERATING MAXIMAL DIRECTED ACYCLIC GRAPHS WITH
CONSTRAINED SET OF SOURCES AND TARGETS
ENUMERATING BUBBLES: LISTING PAIRS OF VERTEX DISJOINT PATHS
ENUMERATING CYCLES AND (S,T)-PATHS IN UNDIRECTED GRAPHS
ENUMERATING DIAMETRAL AND RADIAL VERTICES AND COMPUTING DIAMETER AND
RADIUS OF A GRAPH
CONCLUSIONS
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
ANALYSIS AND ENUMERATION
/ MARINO, ANDREA
: 2015
ABSTRACT / INHALTSTEXT
IN THIS WORK WE PLAN TO REVISE THE MAIN TECHNIQUES FOR ENUMERATION
ALGORITHMS AND TO SHOW FOUR EXAMPLES OF ENUMERATION ALGORITHMS THAT CAN
BE APPLIED TO EFFICIENTLY DEAL WITH SOME BIOLOGICAL PROBLEMS MODELLED BY
USING BIOLOGICAL NETWORKS: ENUMERATING CENTRAL AND PERIPHERAL NODES OF A
NETWORK, ENUMERATING STORIES, ENUMERATING PATHS OR CYCLES, AND
ENUMERATING BUBBLES. NOTICE THAT THE CORRESPONDING COMPUTATIONAL
PROBLEMS WE DEFINE ARE OF MORE GENERAL INTEREST AND OUR RESULTS HOLD IN
THE CASE OF ARBITRARY GRAPHS. ENUMERATING ALL THE MOST AND LESS CENTRAL
VERTICES IN A NETWORK ACCORDING TO THEIR ECCENTRICITY IS AN EXAMPLE OF
AN ENUMERATION PROBLEM WHOSE SOLUTIONS ARE POLYNOMIAL AND CAN BE LISTED
IN POLYNOMIAL TIME, VERY OFTEN IN LINEAR OR ALMOST LINEAR TIME IN
PRACTICE. ENUMERATING STORIES, I.E.ALL MAXIMAL DIRECTED ACYCLIC
SUBGRAPHS OF A GRAPH G WHOSE SOURCES AND TARGETS BELONG TO A PREDEFINED
SUBSET OF THE VERTICES, IS ON THE OTHER HAND AN EXAMPLE OF AN
ENUMERATION PROBLEM WITH AN EXPONENTIAL NUMBER OF SOLUTIONS, THAT CAN BE
SOLVED BY USING A NON TRIVIAL BRUTE-FORCE APPROACH. GIVEN A METABOLIC
NETWORK, EACH INDIVIDUAL STORY SHOULD EXPLAIN HOW SOME INTERESTING
METABOLITES ARE DERIVED FROM SOME OTHERS THROUGH A CHAIN OF REACTIONS,
BY KEEPING ALL ALTERNATIVE PATHWAYS BETWEEN SOURCES AND TARGETS.
ENUMERATING CYCLES OR PATHS IN AN UNDIRECTED GRAPH, SUCH AS A
PROTEIN-PROTEIN INTERACTION UNDIRECTED NETWORK, IS AN EXAMPLE OF AN
ENUMERATION PROBLEM IN WHICH ALL THE SOLUTIONS CAN BE LISTED THROUGH AN
OPTIMAL ALGORITHM, I.E. THE TIME REQUIRED TO LIST ALL THE SOLUTIONS IS
DOMINATED BY THE TIME TO READ THE GRAPH PLUS THE TIME REQUIRED TO PRINT
ALL OF THEM.BY EXTENDING THIS RESULT TO DIRECTED GRAPHS, IT WOULD BE
POSSIBLE TO DEAL MORE EFFICIENTLY WITH FEEDBACK LOOPS AND SIGNED PATHS
ANALYSIS IN SIGNED OR INTERACTION DIRECTED GRAPHS, SUCH AS GENE
REGULATORY NETWORKS. FINALLY, ENUMERATING MOUTHS OR BUBBLES WITH A
SOURCE S IN A DIRECTED GRAPH, THAT IS ENUMERATING ALL THE TWO
VERTEX-DISJOINT DIRECTED PATHS BETWEEN THE SOURCE S AND ALL THE POSSIBLE
TARGETS, IS AN EXAMPLE OF AN ENUMERATION PROBLEM IN WHICH ALL THE
SOLUTIONS CAN BE LISTED THROUGH A LINEAR DELAY ALGORITHM, MEANING THAT
THE DELAY BETWEEN ANY TWO CONSECUTIVE SOLUTIONS IS LINEAR, BY TURNING
THE PROBLEM INTO A CONSTRAINED CYCLE ENUMERATION PROBLEM. SUCH PATTERNS,
IN A DE BRUIJN GRAPH REPRESENTATION OF THE READS OBTAINED BY SEQUENCING,
ARE RELATED TO POLYMORPHISMS IN DNA- OR RNA-SEQ DATA
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
| any_adam_object | 1 |
| author | Marino, Andrea |
| author_facet | Marino, Andrea |
| author_role | aut |
| author_sort | Marino, Andrea |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV042482274 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA |
| ctrlnum | (OCoLC)906205516 (DE-599)BVBBV042482274 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.2991/978-94-6239-097-3 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02795nmm a2200589zcb4500</leader><controlfield tag="001">BV042482274</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200929 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150402s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789462390973</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-6239-097-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2991/978-94-6239-097-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)906205516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042482274</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Marino, Andrea</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis and enumeration</subfield><subfield code="b">algorithms for biological graphs</subfield><subfield code="c">Andrea Marino</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Paris</subfield><subfield code="b">Atlantis Press</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 151 S.)</subfield><subfield code="b">39 illus</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Atlantis studies in computing</subfield><subfield code="v">6</subfield><subfield code="x">2212-8557</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data mining</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bioinformatics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Mining and Knowledge Discovery</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Biology/Bioinformatics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-94-6239-096-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Atlantis Studies in Computing</subfield><subfield code="v">6</subfield><subfield code="w">(DE-604)BV040353030</subfield><subfield code="9">6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBY_PDA_SMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_2015</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027917233</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2991/978-94-6239-097-3</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV042482274 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:23:01Z |
| institution | BVB |
| isbn | 9789462390973 |
| issn | 2212-8557 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027917233 |
| oclc_num | 906205516 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-703 DE-20 DE-739 DE-634 DE-861 DE-83 |
| owner_facet | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-703 DE-20 DE-739 DE-634 DE-861 DE-83 |
| physical | 1 Online-Ressource (XVII, 151 S.) 39 illus |
| psigel | ZDB-2-SMA UBY_PDA_SMA ZDB-2-SMA_2015 |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Atlantis Press |
| record_format | marc |
| series | Atlantis Studies in Computing |
| series2 | Atlantis studies in computing |
| spelling | Marino, Andrea Verfasser aut Analysis and enumeration algorithms for biological graphs Andrea Marino Paris Atlantis Press 2015 1 Online-Ressource (XVII, 151 S.) 39 illus txt rdacontent c rdamedia cr rdacarrier Atlantis studies in computing 6 2212-8557 Computer science Computer software Data mining Bioinformatics Computer Science Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Computational Biology/Bioinformatics Informatik Erscheint auch als Druckausgabe 978-94-6239-096-6 Atlantis Studies in Computing 6 (DE-604)BV040353030 6 https://doi.org/10.2991/978-94-6239-097-3 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
| spellingShingle | Marino, Andrea Analysis and enumeration algorithms for biological graphs Atlantis Studies in Computing Computer science Computer software Data mining Bioinformatics Computer Science Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Computational Biology/Bioinformatics Informatik |
| title | Analysis and enumeration algorithms for biological graphs |
| title_auth | Analysis and enumeration algorithms for biological graphs |
| title_exact_search | Analysis and enumeration algorithms for biological graphs |
| title_full | Analysis and enumeration algorithms for biological graphs Andrea Marino |
| title_fullStr | Analysis and enumeration algorithms for biological graphs Andrea Marino |
| title_full_unstemmed | Analysis and enumeration algorithms for biological graphs Andrea Marino |
| title_short | Analysis and enumeration |
| title_sort | analysis and enumeration algorithms for biological graphs |
| title_sub | algorithms for biological graphs |
| topic | Computer science Computer software Data mining Bioinformatics Computer Science Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Computational Biology/Bioinformatics Informatik |
| topic_facet | Computer science Computer software Data mining Bioinformatics Computer Science Algorithm Analysis and Problem Complexity Data Mining and Knowledge Discovery Computational Biology/Bioinformatics Informatik |
| url | https://doi.org/10.2991/978-94-6239-097-3 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027917233&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV040353030 |
| work_keys_str_mv | AT marinoandrea analysisandenumerationalgorithmsforbiologicalgraphs |