Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors | Paper Citation Record

Observation 9b9fe06d-e828-4e2c-9b65-c4a93d45e03e · outbound

This paper cites SIAM Journal on Com- puting 10(3):405–421, DOI 10.1137/0210030.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors SIAM Journal on Com- puting 10(3):405–421, DOI 10.1137/0210030

Reference 1

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.469596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fbab74cc-9889-4f28-9248-1ecb59b837e9 · outbound

This paper cites Springer Monographs in Mathematics, Springer.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Springer Monographs in Mathematics, Springer

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-25T21:35:32.608194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa1b648b-8a5d-4e35-ba4f-8e1e315c9353 · outbound

This paper cites theory and methods in phyloge- netic analysis.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors theory and methods in phyloge- netic analysis

Reference 3

Resolution: malformed identifier; doi_truncated, observed 2026-06-25T21:38:28.474788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 38eaa552-9a74-463d-9306-c6b1292a9195 · outbound

This paper cites Stanley , abstract =.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Stanley , abstract =

Reference 4

Resolution: metadata mismatch; arxiv_id, observed 2026-06-25T21:38:28.478238Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ef544842-457d-471e-a876-910d5fd308db · outbound

This paper cites Discrete Applied Mathematics 127(2):241–269, DOI 10.1016/S0166-218X(02) 00209-3.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Discrete Applied Mathematics 127(2):241–269, DOI 10.1016/S0166-218X(02) 00209-3

Reference 5

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.480672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 574c4f78-2042-48fe-9d61-d0b0b38d313c · outbound

This paper cites MIT press.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors MIT press

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-25T21:35:32.608194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1107a5d-27ef-4cf5-935a-2510bd199ab6 · outbound

This paper cites Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints

Reference 7

Resolution: metadata mismatch; local_arxiv, observed 2026-07-04T19:10:05.860825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation f982bd23-4edb-439f-8e64-c46e986d7fc9 · outbound

This paper cites Journal of Mathematical Biology 74(7):1729–1751, DOI 10.1007/s00285-016-1068-3.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Mathematical Biology 74(7):1729–1751, DOI 10.1007/s00285-016-1068-3

Reference 8

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.483100Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5b229e0c-d6b1-4153-8354-b9846a70ab8c · outbound

This paper cites Journal of Mathematical Biology 78(7):2015–2057, DOI 10.1007/s00285-019-01332-9.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Mathematical Biology 78(7):2015–2057, DOI 10.1007/s00285-019-01332-9

Reference 9

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.485862Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation f27bcfdc-a51f-406d-a5a6-3d07387aadb8 · outbound

This paper cites Journal of Mathematical Biology 80(3):865–953, DOI 10.1007/s00285-019-01444-2.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Mathematical Biology 80(3):865–953, DOI 10.1007/s00285-019-01444-2

Reference 10

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.467462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b74a895e-3b75-48ac-8795-3ad0328b907e · outbound

This paper cites IEEE/ACM Transactions on Computational Biology and Bioinformatics 10(1):151– 160, DOI 10.1109/TCBB.2013.8.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors IEEE/ACM Transactions on Computational Biology and Bioinformatics 10(1):151– 160, DOI 10.1109/TCBB.2013.8

Reference 11

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.472060Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation f6211c70-1834-4fcb-a9d8-cb5d343e51f4 · outbound

This paper cites Journal of Bioinformatics and Computational Biology 04(01):59–74, DOI 10.1142/S0219720006001709.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Bioinformatics and Computational Biology 04(01):59–74, DOI 10.1142/S0219720006001709

Reference 12

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.517812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 8dcde002-aef0-4760-bb45-813b9101a530 · outbound

This paper cites URLhttps://arxiv.org/abs/2606.16963,2606.16963.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors URLhttps://arxiv.org/abs/2606.16963,2606.16963

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-07-04T19:10:05.856466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5cf3ed83-7f0e-430f-a843-f2fcda4ea9b6 · outbound

This paper cites Algorithmica 66(3):714–738, DOI 10.1007/s00453-012-9659-x.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Algorithmica 66(3):714–738, DOI 10.1007/s00453-012-9659-x

Reference 14

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.527492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 05d1c545-c753-4262-9857-b1419fdad06d · outbound

This paper cites IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):635–649, DOI 10.1109/TCBB.2010.17.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):635–649, DOI 10.1109/TCBB.2010.17

Reference 15

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.505808Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 2a55d620-0b53-4be4-a3fa-220c6b109891 · outbound

This paper cites Algorithmica 77(1):173–200, DOI 10.1007/s00453-015-0069-8.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Algorithmica 77(1):173–200, DOI 10.1007/s00453-015-0069-8

Reference 16

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.531491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 58ccf14f-dde7-42b4-8412-821621d5dd30 · outbound

This paper cites IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(4):151–158, DOI 10.1109/TCBB.2004.44.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(4):151–158, DOI 10.1109/TCBB.2004.44

Reference 17

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.520106Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation af25ac3d-2392-434e-bb38-da1a3cfa93da · outbound

This paper cites Genome Biol Evol 3:23–35, DOI 10.1093/gbe/evq077.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Genome Biol Evol 3:23–35, DOI 10.1093/gbe/evq077

Reference 18

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.490728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 6bb43609-3b2b-4c90-8cab-9b23d5bb08ac · outbound

This paper cites In: Jonassen I, Kim J (eds) Algorithms in Bioinformatics, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 388–399, DOI 10.1007/978-3-540-30219-3 33.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors In: Jonassen I, Kim J (eds) Algorithms in Bioinformatics, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 388–399, DOI 10.1007/978-3-540-30219-3 33

Reference 19

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.543891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fd44ded2-bdd0-4424-a609-aa745fc36928 · outbound

This paper cites Cambridge University Press.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Cambridge University Press

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-25T21:35:32.608194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07a56bc2-4105-40c1-80af-42ef7e0fed28 · outbound

This paper cites Algorithmica 60(2):207–235, DOI 10.1007/s00453-009-9333-0.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Algorithmica 60(2):207–235, DOI 10.1007/s00453-009-9333-0

Reference 21

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.516847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1681ae01-4660-4b03-a050-6611a0b3c274 · outbound

This paper cites Journal of Mathe- matical Biology 68(7):1707–1729, DOI 10.1007/s00285-013-0683-5.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Mathe- matical Biology 68(7):1707–1729, DOI 10.1007/s00285-013-0683-5

Reference 22

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.493096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7edb8483-e7e0-4912-8919-6d50d6a62e56 · outbound

This paper cites van Iersel, J.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors van Iersel, J

Reference 23

Resolution: metadata mismatch; doi, observed 2026-06-25T21:38:28.534177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation be2cb403-f8a1-4fb6-bffe-83711357e4dc · outbound

This paper cites Journal of Bioinformatics and Computational Biology 07(04):597–623, DOI 10.1142/S0219720009004308.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Bioinformatics and Computational Biology 07(04):597–623, DOI 10.1142/S0219720009004308

Reference 24

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.524492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 6fbbf5c6-6659-4251-904c-9b9b133fd502 · outbound

This paper cites Information Processing Letters 178:106300, DOI 10.1016/j.ipl.2022.106300.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Information Processing Letters 178:106300, DOI 10.1016/j.ipl.2022.106300

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-06-25T21:38:28.509616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 2c132903-30f2-4cad-8565-003b35edb1f1 · outbound

This paper cites Theoret- ical Computer Science 363(1):60–68, DOI 10.1016/j.tcs.2006.06.022, computing and Combinatorics.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Theoret- ical Computer Science 363(1):60–68, DOI 10.1016/j.tcs.2006.06.022, computing and Combinatorics

Reference 26

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.521265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 9f8ec73c-f793-48d8-be77-7ddc8010789a · outbound

This paper cites SIAM Journal on Computing 35(5):1098–1121, DOI 10.1137/S0097539704446529.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors SIAM Journal on Computing 35(5):1098–1121, DOI 10.1137/S0097539704446529

Reference 27

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.538916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 128f7bf5-3425-4195-831c-266f78e244cf · outbound

This paper cites Nash equilibria in V oronoi games on graphs.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Nash equilibria in V oronoi games on graphs

Reference 28

Resolution: metadata mismatch; doi, observed 2026-06-25T21:38:28.488477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5cebd6a7-94ca-4537-a329-13b6c8942bca · outbound

This paper cites Bull Math Biol 87(3):44, DOI 10.1007/s11538-025-01419-z.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Bull Math Biol 87(3):44, DOI 10.1007/s11538-025-01419-z

Reference 29

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.536658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7cbfecd6-b936-489e-9fb9-a5c227ea8a1c · outbound

This paper cites Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno

Reference 30

Resolution: malformed identifier; doi_truncated, observed 2026-06-25T21:38:28.523275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d5c9bbfc-8265-486e-9e4e-67b08b8c6f95 · outbound

This paper cites Oxford University Press.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Oxford University Press

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-25T21:35:32.608194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33743283-1c99-4cac-876f-f25a639e17e0 · outbound

This paper cites Discrete Applied Mathematics 98(3):227–235, DOI 10.1016/S0166-218X(99)00160-2.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Discrete Applied Mathematics 98(3):227–235, DOI 10.1016/S0166-218X(99)00160-2

Reference 32

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.525289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ece0789c-7240-46ba-aa11-8d81ab42d40e · outbound

This paper cites PLOS ONE 9(9):1–1, DOI 10.1371/journal.pone.0106531.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors PLOS ONE 9(9):1–1, DOI 10.1371/journal.pone.0106531

Reference 33

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.495237Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 2b1a3d09-4417-48f4-a85c-7a3a2d1a98be · outbound

This paper cites Theo- retical Computer Science 865:63–84, DOI 10.1016/j.tcs.2021.02.037.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Theo- retical Computer Science 865:63–84, DOI 10.1016/j.tcs.2021.02.037

Reference 34

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.518983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation aefd2968-24f4-490b-94f9-ff6e3ef7a5ad · outbound

This paper cites Birkh¨auser Boston, DOI 10.1007/978-1-4612-0053-6.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Birkh¨auser Boston, DOI 10.1007/978-1-4612-0053-6

Reference 35

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.513235Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1660751a-701a-4732-9274-49f54ed5a653 · outbound

This paper cites European Journal of Combinatorics 70:384–407, DOI 10.1016/j.ejc.2018.02.013.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors European Journal of Combinatorics 70:384–407, DOI 10.1016/j.ejc.2018.02.013

Reference 36

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.529492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d7d8bb42-be6a-4d43-91f6-54e15d21e204 · outbound

This paper cites Journal of Mathematical Biology 83(3):28, DOI 10.1007/s00285-021-01654-7.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors Journal of Mathematical Biology 83(3):28, DOI 10.1007/s00285-021-01654-7

Reference 37

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.512059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ea32173f-96a8-4a87-8086-40c51944a18e · outbound

This paper cites IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):785–796, DOI 10.1109/TCBB.2010.69 31.

Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(3):785–796, DOI 10.1109/TCBB.2010.69 31

Reference 38

Resolution: verified exact; doi, observed 2026-06-25T21:38:28.541306Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers