On the Number of 2-Protected Nodes in Tries and Suffix Trees
We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.80...
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AQ,...; číslo Proceedings; s. 381 - 398 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
DMTCS
01.01.2012
Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science |
| Edice: | DMTCS Proceedings |
| Témata: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.803$n$, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe. |
|---|---|
| AbstractList | We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.803$n$, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe. |
| Author | Sellke, Mark Gaither, Jeffrey Ward, Mark Daniel Homma, Yushi |
| Author_xml | – sequence: 1 givenname: Jeffrey surname: Gaither fullname: Gaither, Jeffrey organization: Department of mathematics Purdue University – sequence: 2 givenname: Yushi surname: Homma fullname: Homma, Yushi organization: Department of mathematics Purdue University – sequence: 3 givenname: Mark surname: Sellke fullname: Sellke, Mark organization: Department of mathematics Purdue University – sequence: 4 givenname: Mark Daniel surname: Ward fullname: Ward, Mark Daniel organization: Department of Statistics |
| BackLink | https://inria.hal.science/hal-01197232$$DView record in HAL |
| BookMark | eNpVkEFLAzEUhINUsK2e_AO5imxN9mWTXfBSitpCaQXrOWSTF7ul3Uh2K_rv3bYienrzPmbmMAPSq0ONhFxzNhIyLfI7t2ttMwLG8jPS5yCzJGcZ6_3RF2TQNBvGeFoI1Sf3y5q2a6SL_a7ESIOnafIcQ4u2RUcXwWFDq5quYtUJUzv6sve--uwAYnNJzr3ZNnj1c4fk9fFhNZkm8-XTbDKeJ5YryBMvQJYKFPiSSZRGlCpn4HmWA8rMZTxl0uZcoJCZAeNNWUjuFfO28GBNCkMyO_W6YDb6PVY7E790MJU-ghDftIltZbeoC1DKCcFKj0xkkBoEFM4oDt443n1DcnPqWpvtv6rpeK4PjHFeqBTSD955b09eG0PTRPS_Ac70cXB9HFwfBodvlbBy8w |
| ContentType | Journal Article Conference Proceeding |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.46298/dmtcs.3008 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1365-8050 |
| EndPage | 398 |
| ExternalDocumentID | oai_doaj_org_article_9377d440bfe04532ae3e4da713fad1ae oai:HAL:hal-01197232v1 10_46298_dmtcs_3008 |
| GroupedDBID | -~9 .4S .DC 29G 2WC 5GY 5VS 8FE 8FG AAFWJ AAYXX ABDBF ABJCF ABUWG ACGFO ACIWK ACUHS ADBBV ADQAK AENEX AFFHD AFKRA AFPKN AIAGR ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS B0M BCNDV BENPR BFMQW BGLVJ BPHCQ C1A CCPQU CITATION EAP EBS ECS EDO EJD EMK EPL EST ESX GROUPED_DOAJ HCIFZ I-F IAO IBB ICD ITC J9A KQ8 KWQ L6V M7S MK~ ML~ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS REM RNS RSU TR2 TUS XSB ~8M 1XC VOOES |
| ID | FETCH-LOGICAL-c1738-f436b7373fb06e6a4b7803f1583e65d51206c814e465a3afab961f70fc9f3ca23 |
| IEDL.DBID | DOA |
| ISSN | 1365-8050 1462-7264 |
| IngestDate | Mon Nov 10 04:33:51 EST 2025 Sat Nov 29 15:00:35 EST 2025 Sat Nov 29 02:48:24 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Proceedings |
| Keywords | retrieval trees pattern matching suffix trees Mellin transforms Poissonization |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MeetingName | 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12) |
| MergedId | FETCHMERGED-LOGICAL-c1738-f436b7373fb06e6a4b7803f1583e65d51206c814e465a3afab961f70fc9f3ca23 |
| OpenAccessLink | https://doaj.org/article/9377d440bfe04532ae3e4da713fad1ae |
| PageCount | 18 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_9377d440bfe04532ae3e4da713fad1ae hal_primary_oai_HAL_hal_01197232v1 crossref_primary_10_46298_dmtcs_3008 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-01-01 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – month: 01 year: 2012 text: 2012-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationSeriesTitle | DMTCS Proceedings |
| PublicationTitle | Discrete mathematics and theoretical computer science |
| PublicationYear | 2012 |
| Publisher | DMTCS Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science |
| Publisher_xml | – name: Discrete Mathematics and Theoretical Computer Science – name: DMTCS – name: Discrete Mathematics & Theoretical Computer Science |
| SSID | ssj0012947 ssib044734695 |
| Score | 1.8250479 |
| Snippet | We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| StartPage | 381 |
| SubjectTerms | [info.info-cg] computer science [cs]/computational geometry [cs.cg] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [math.math-co] mathematics [math]/combinatorics [math.co] Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics Mathematics mellin transforms pattern matching poissonization retrieval trees suffix trees |
| Title | On the Number of 2-Protected Nodes in Tries and Suffix Trees |
| URI | https://inria.hal.science/hal-01197232 https://doaj.org/article/9377d440bfe04532ae3e4da713fad1ae |
| Volume | DMTCS Proceedings vol. AQ,... |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: DOA dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044734695 issn: 1365-8050 databaseCode: M~E dateStart: 19980101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Continental Europe Database (ProQuest) customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BFMQW dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/conteurope providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: M7S dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BENPR dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: PIMPY dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwEB0h4FAOQGkRS8vKQlxTEtuxHamXLQJRqbusVCrRU-TEM2IPZNFmQZz47Uw-FtETl14iZWQl0ZuMZ8ZO3gM4MbEsuPCkyKWOGxTO-FGh0zLyssy0TAIHSWjFJuxk4m5usukbqa_mm7COHrgD7pTTpw1axwUhVx9KelSog-feinxIPDazb2yzVTPV7x_ITNvubzxtZOZOw92yrL-puFGRfJN_Wpp-ziq3q1XUNqtc7MJ2Xw6KUfcYH2ENqz3YWUktiD7y9mBr_EqvWn-C71eV4FMxaeU8xJyEjKYd4QIGMZkHrMWsEtdNGyx8FcTvB6LZExsQ68_w5-L8-uwy6mUQojKxPB2RVqawyioqYoPG68K6WFGSOoUmDZyxY1O6RKM2qVeefJGZhGxMZUaq9FLtw3o1r_AABBpSqUZUjKMmS06GYHk0h0ogh8kATlbg5Pcd20XOXUKLYd5imDcYDuBHA9zrkIaiujWw4_Lecfl7jhvAMcP-zzUuR7_yxtaLocnH5PB_3OkLfOAyR3YLJ19hfbl4wCPYLB-Xs3oxbF8cPo6fz4ewMf05nv59AUJHyX8 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Discrete+mathematics+and+theoretical+computer+science&rft.atitle=On+the+Number+of+2-Protected+Nodes+in+Tries+and+Suffix+Trees&rft.au=Gaither%2C+Jeffrey&rft.au=Homma%2C+Yushi&rft.au=Sellke%2C+Mark&rft.au=Ward%2C+Mark+Daniel&rft.series=DMTCS+Proceedings&rft.date=2012-01-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=DMTCS+Proceedings+vol.+AQ%2C+23rd+Intern.+Meeting+on+Probabilistic%2C+Combinatorial%2C+and+Asymptotic+Methods+for+the+Analysis+of+Algorithms+%28AofA%2712%29&rft.spage=381&rft.epage=398&rft_id=info:doi/10.46298%2Fdmtcs.3008&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01197232v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon |